結果
問題 | No.1117 数列分割 |
ユーザー |
![]() |
提出日時 | 2020-07-17 22:53:19 |
言語 | C++11 (gcc 13.3.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 3,021 bytes |
コンパイル時間 | 1,200 ms |
コンパイル使用メモリ | 95,100 KB |
実行使用メモリ | 13,636 KB |
最終ジャッジ日時 | 2024-11-30 04:00:27 |
合計ジャッジ時間 | 53,836 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 16 TLE * 10 |
ソースコード
#include <iostream>#include <cstdio>#include <cmath>#include <ctime>#include <cstdlib>#include <cassert>#include <vector>#include <list>#include <stack>#include <queue>#include <deque>#include <map>#include <set>#include <bitset>#include <string>#include <algorithm>#include <utility>#define llint long long#define inf 1e18#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)#define chmin(x, y) (x) = min((x), (y))#define chmax(x, y) (x) = max((x), (y))#define mod 998244353using namespace std;typedef pair<llint, llint> P;// range-add, range-min querystruct LazySegTree{int size;vector<llint> seg, delay;LazySegTree(){}LazySegTree(int size){this->size = size;seg.resize(1<<(size+1));delay.resize(1<<(size+1));}void init(){for(int i = 0; i < (1<<(size+1)); i++){seg[i] = -inf;delay[i] = 0;}}void eval(int l, int r, int k){if(delay[k]){seg[k] += delay[k]; //総和クエリのときは区間幅を乗じる必要があるif(l < r){delay[k*2] += delay[k];delay[k*2+1] += delay[k];}delay[k] = 0;}}void update(int i, llint val){int l = 0, r = (1<<size)-1, k = 1;eval(l, r, k);for(int j = size-1; j >= 0; j--){k <<= 1;if(i & (1<<j)){k++;r = (l+r)/2;}else l = (l+r)/2+1;eval(l, r, k);}i += (1 << size);seg[i] = val;while(i > 1){i /= 2;seg[i] = max(seg[i*2], seg[i*2+1]);}}void add(int a, int b, int k, int l, int r, llint val){eval(l, r, k);if(b < l || r < a) return;if(a <= l && r <= b){delay[k] += val;eval(l, r, k);return;}add(a, b, k*2, l, (l+r)/2, val);add(a, b, k*2+1, (l+r)/2+1, r, val);seg[k] = max(seg[k*2], seg[k*2+1]);}void add(int a, int b, llint val){if(a > b) return;add(a, b, 1, 0, (1<<size)-1, val);}llint query(int a, int b, int k, int l, int r){eval(l, r, k);if(b < l || r < a) return -inf;if(a <= l && r <= b) return seg[k];llint lval = query(a, b, k*2, l, (l+r)/2);llint rval = query(a, b, k*2+1, (l+r)/2+1, r);return max(lval, rval);}llint query(int a, int b){return query(a, b, 1, 0, (1<<size)-1);}};llint n, k, m;LazySegTree seg[2], seg2[2];llint a[3005];int main(void){ios::sync_with_stdio(0);cin.tie(0);cin >> n >> k >> m;for(int i = 1; i <= n; i++) cin >> a[i];for(int i = 0; i < 2; i++){seg[i] = LazySegTree(12), seg[i].init();seg2[i] = LazySegTree(12), seg2[i].init();}seg[0].update(0, 0), seg2[0].update(0, 0);for(int i = 1; i <= k; i++){seg[i%2].update(0, -inf), seg2[i%2].update(0, -inf);for(int j = 1; j <= n; j++){seg[(i-1)%2].add(0, j-1, a[j]);seg2[(i-1)%2].add(0, j-1, -a[j]);llint tmp = max(seg[(i-1)%2].query(max(0LL, j-m), j-1), seg2[(i-1)%2].query(max(0LL, j-m), j-1));seg[i%2].update(j, tmp);seg2[i%2].update(j, tmp);}}cout << seg[k%2].query(n, n) << endl;return 0;}