結果

問題 No.1117 数列分割
ユーザー hitonanodehitonanode
提出日時 2020-07-17 22:52:33
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 500 ms / 3,000 ms
コード長 4,478 bytes
コンパイル時間 2,494 ms
コンパイル使用メモリ 213,528 KB
実行使用メモリ 8,704 KB
最終ジャッジ日時 2024-11-30 03:58:33
合計ジャッジ時間 6,814 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,820 KB
testcase_03 AC 22 ms
6,816 KB
testcase_04 AC 27 ms
7,552 KB
testcase_05 AC 2 ms
6,820 KB
testcase_06 AC 2 ms
6,816 KB
testcase_07 AC 2 ms
6,816 KB
testcase_08 AC 18 ms
6,820 KB
testcase_09 AC 7 ms
6,820 KB
testcase_10 AC 18 ms
6,816 KB
testcase_11 AC 68 ms
6,820 KB
testcase_12 AC 73 ms
6,820 KB
testcase_13 AC 105 ms
6,816 KB
testcase_14 AC 106 ms
6,816 KB
testcase_15 AC 142 ms
6,820 KB
testcase_16 AC 153 ms
6,820 KB
testcase_17 AC 18 ms
6,816 KB
testcase_18 AC 500 ms
8,704 KB
testcase_19 AC 353 ms
7,424 KB
testcase_20 AC 122 ms
6,820 KB
testcase_21 AC 334 ms
7,552 KB
testcase_22 AC 325 ms
7,296 KB
testcase_23 AC 327 ms
7,424 KB
testcase_24 AC 324 ms
7,296 KB
testcase_25 AC 320 ms
7,424 KB
testcase_26 AC 2 ms
6,816 KB
testcase_27 AC 13 ms
6,820 KB
testcase_28 AC 14 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template <typename V, typename T> void ndfill(V &x, const T &val) { x = val; }
template <typename V, typename T> void ndfill(vector<V> &vec, const T &val) { for (auto &v : vec) ndfill(v, val); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> srtunq(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << "(" << pa.first << "," << pa.second << ")"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int main()
{
    int N, K, M;
    cin >> N >> K >> M;
    vector<lint> A(N), B(N + 1);
    cin >> A;
    REP(i, N) B[i + 1] = B[i] + A[i];

    vector<deque<plint>> VH(K + 1), VL(K + 1);
    constexpr lint INF = 1e18;
    REP(k, K + 1)
    {
        VH[k].emplace_back(B[N], 0);
        VL[k].emplace_back(-B[N], 0);
    };
    REP(i, N)
    {
        IREP(k, K)
        {
            while (VH[k].size() and VH[k].front().second < i + 1 - M) VH[k].pop_front();
            while (VL[k].size() and VL[k].front().second < i + 1 - M) VL[k].pop_front();
            lint q = -INF;
            if (VH[k].size()) chmax(q, VH[k].front().first - (B[N] - B[i + 1]));
            if (VL[k].size()) chmax(q, VL[k].front().first + (B[N] - B[i + 1]));

            lint tmp = q + B[N] - B[i + 1];
            while (VH[k + 1].size() and VH[k + 1].back().first < tmp) VH[k + 1].pop_back();
            VH[k + 1].emplace_back(tmp, i + 1);

            tmp = q - B[N] + B[i + 1];
            while (VL[k + 1].size() and VL[k + 1].back().first < tmp) VL[k + 1].pop_back();
            VL[k + 1].emplace_back(tmp, i + 1);
        }
    }
    cout << VH[K].back().first << '\n';
}
0