結果
問題 | No.1117 数列分割 |
ユーザー |
👑 ![]() |
提出日時 | 2020-07-17 22:42:06 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 571 ms / 3,000 ms |
コード長 | 6,111 bytes |
コンパイル時間 | 2,629 ms |
コンパイル使用メモリ | 211,072 KB |
最終ジャッジ日時 | 2025-01-11 23:08:55 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
//#define _GLIBCXX_DEBUG#include<bits/stdc++.h>using namespace std;#define endl '\n'#define lfs cout<<fixed<<setprecision(10)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 1e18;using P = pair<ll, ll>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());template< typename Monoid ,typename F>struct SegmentTree {int sz, n;vector< Monoid > seg;const F f;const Monoid M1;SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1), n(n){sz = 1;while(sz < n) sz <<= 1;seg.assign(2 * sz, M1);}void set(int k, const Monoid &x) {seg[k + sz] = x;}void build() {for(int k = sz - 1; k > 0; k--) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}void update(int k, const Monoid &x) {k += sz;seg[k] = x;while(k >>= 1) {seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);}}Monoid query(int a, int b) {if(a>=b)return M1;Monoid L = M1, R = M1;for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if(a & 1) L = f(L, seg[a++]);if(b & 1) R = f(seg[--b], R);}return f(L, R);}Monoid operator[](const int &k) const {return seg[k + sz];}template< typename C >int find_subtree(int a, const C &check, Monoid &M, bool type) {while(a < sz) {Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);if(check(nxt)) a = 2 * a + type;else M = nxt, a = 2 * a + 1 - type;}return a - sz;}template< typename C >int find_first(int a, const C &check) {Monoid L = M1;if(a <= 0) {if(check(f(L, seg[1]))) return find_subtree(1, check, L, false);return -1;}int b = sz;for(a += sz, b += sz; a < b; a >>= 1, b >>= 1) {if(a & 1) {Monoid nxt = f(L, seg[a]);if(check(nxt)) return find_subtree(a, check, L, false);L = nxt;++a;}}return -1;}template< typename C >int find_last(int b, const C &check) {Monoid R = M1;if(b >= sz) {if(check(f(seg[1], R))) return find_subtree(1, check, R, true);return -1;}int a = sz;for(b += sz; a < b; a >>= 1, b >>= 1) {if(b & 1) {Monoid nxt = f(seg[--b], R);if(check(nxt)) return find_subtree(b, check, R, true);R = nxt;}}return -1;}void print(){for(ll i=0;i<n;i++)if((*this)[i]==M1)cout<<"x ";else cout<<(*this)[i]<<" ";cout<<endl;}};template<typename T>struct SWAG{stack<pair<T,T>>st_front,st_back;T func(T x, T y){return max(x,y);}void push(T x){if(st_back.empty())st_back.emplace(x,x);else st_back.emplace(x,func(st_back.top().second,x));}void pop(){if(st_front.empty()){while(!st_back.empty()){if(st_front.empty())st_front.emplace(st_back.top().first,st_back.top().first);else st_front.emplace(st_back.top().first,func(st_back.top().first, st_front.top().second));st_back.pop();}}st_front.pop();}T query(){if(st_front.empty())return st_back.top().second;else if(st_back.empty())return st_front.top().second;else return func(st_front.top().second, st_back.top().second);}bool empty(){return st_front.empty() && st_back.empty();}int size(){return st_front.size() + st_back.size();}};int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;ll n,k,m;cin>>n>>k>>m;vector<ll>a(n);rep(i,0,n)cin>>a[i];vector<ll>b(n+1);rep(i,0,n)b[i+1]=b[i]+a[i];auto f=[&](ll x,ll y){return max(x,y);};vector<P>p(n+1);rep(i,0,n+1)p[i]=MP(b[i],i);sort(ALL(p));vector<ll>idx(n+1);rep(i,0,n+1)idx[p[i].se]=i;auto dp=vec(n+1,k+1,-INF);dp[0][0]=0;rep(j,1,k+1){SWAG<ll>sw1,sw2;rep(i,0,n){sw1.push(dp[i][j-1]-b[i]);sw2.push(dp[i][j-1]+b[i]);if(i>=m){sw1.pop();sw2.pop();}ll mx1=sw1.query();ll mx2=sw2.query();ll mx=max(mx1+b[i+1],mx2-b[i+1]);if(i==n-1&&j==k)res=mx;dp[i+1][j]=mx;}}//debug(idx,n+1);cout<<res<<endl;return 0;}