結果
| 問題 | No.1117 数列分割 |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-07-18 10:11:52 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,095 ms / 3,000 ms |
| コード長 | 6,790 bytes |
| コンパイル時間 | 1,771 ms |
| コンパイル使用メモリ | 179,412 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-11-30 20:32:48 |
| 合計ジャッジ時間 | 12,700 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
#include <bits/stdc++.h>using namespace std;// Defineusing ll = long long;using ull = unsigned long long;using ld = long double;template <class T> using pvector = vector<pair<T, T>>;template <class T>using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;constexpr const ll dx[4] = {1, 0, -1, 0};constexpr const ll dy[4] = {0, 1, 0, -1};constexpr const ll MOD = 1e9 + 7;constexpr const ll mod = 998244353;constexpr const ll INF = 1LL << 60;constexpr const ll inf = 1 << 30;constexpr const char rt = '\n';constexpr const char sp = ' ';#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)#define len(x) ((ll)(x).size())#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define mp make_pair#define mt make_tuple#define pb push_back#define eb emplace_back#define ifn(x) if (not(x))#define elif else if#define elifn else ifn#define fi first#define se secondtemplate <class T> bool chmax(T &a, const T &b) {if (a < b) {a = b;return 1;}return 0;}template <class T> bool chmin(T &a, const T &b) {if (a > b) {a = b;return 1;}return 0;}// Debug#define debug(...) \{ \cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] "; \cerr << rt; \}#define dump(a, h, w) \{ \cerr << __LINE__ << ": " << #a << " = [" << rt; \rep(_i, h) { \rep(_j, w) { \if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2) \cerr << '-'; \if (abs(a[_i][_j]) >= INF / 2) \cerr << "∞" << sp; \else \cerr << a[_i][_j] << sp; \} \cerr << rt; \} \cerr << "]" << rt; \}#define vdump(a, n) \{ \cerr << __LINE__ << ": " << #a << " = ["; \rep(_i, n) { \if (_i) cerr << sp; \if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) cerr << '-'; \if (abs(a[_i]) >= INF / 2) \cerr << "∞" << sp; \else \cerr << a[_i]; \} \cerr << "]" << rt; \}// Loop#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)#define each(i, a) for (auto &&i : a)// Stream#define fout(n) cout << fixed << setprecision(n)struct io {io() { cin.tie(nullptr), ios::sync_with_stdio(false); }} io;// Speed#pragma GCC optimize("Ofast,unroll-loops")#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")// Mathinline constexpr ll gcd(const ll a, const ll b) {return b ? gcd(b, a % b) : a;}inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }inline constexpr ll modulo(const ll n, const ll m = MOD) {ll k = n % m;return k + m * (k < 0);}inline constexpr ll chmod(ll &n, const ll m = MOD) {n %= m;return n += m * (n < 0);}inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {ll r = 1;rep(i, 64) {if (n & (1LL << i)) r *= a;chmod(r, m);a *= a;chmod(a, m);}return r;}inline ll inv(const ll n, const ll m = MOD) {ll a = n, b = m, x = 1, y = 0;while (b) {ll t = a / b;a -= t * b;swap(a, b);x -= t * y;swap(x, y);}return modulo(x, m);}template <class T = ll> struct SWA {using op = function<T(T, T)>;vector<T> A, B;deque<T> D;op f;SWA(op f = [](ll a, ll b) { return max(a, b); }) : f(f) {}void flip() {if (A.size() == 0) {B.clear();for (auto i = D.end() - 1; i >= D.begin(); i--) {if (i == D.end() - 1) {A.push_back(*i);} else {A.push_back(f(A.back(), *i));}}}}T operator()() {flip();if (A.size() == 0) {abort();} else if (B.size() == 0) {return A.back();} else {return f(A.back(), B.back());}}void push(T x) {D.push_back(x);if (B.size() == 0) {B.push_back(x);} else {B.push_back(f(B.back(), x));}}void pop() {flip();if (A.size() == 0) {abort();} else {A.pop_back();D.pop_front();}}size_t size() { return D.size(); }};ll DP[3001];signed main() {ll N, M, K;cin >> N >> K >> M;ll A[N + 1] = {};rep(i, N) cin >> A[i + 1];rep(i, N) A[i + 1] += A[i];inc(i, 0, N) DP[i] = -INF;DP[0] = 0;rep(j, K) {SWA<ll> swa[2];inc(i, 0, N) {ll mem = DP[i];swa[0].push(mem - A[i]);swa[1].push(mem + A[i]);DP[i] = max(swa[0]() + A[i], swa[1]() - A[i]);if (i - M >= 0) {rep(k, 2) swa[k].pop();}}}cout << DP[N] << rt;}