結果

問題 No.1117 数列分割
ユーザー haruki_Kharuki_K
提出日時 2020-07-17 22:30:19
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 580 ms / 3,000 ms
コード長 6,221 bytes
コンパイル時間 2,871 ms
コンパイル使用メモリ 211,252 KB
実行使用メモリ 73,988 KB
最終ジャッジ日時 2023-08-20 03:49:57
合計ジャッジ時間 7,860 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 31 ms
8,528 KB
testcase_04 AC 26 ms
8,244 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 18 ms
7,600 KB
testcase_09 AC 6 ms
4,624 KB
testcase_10 AC 19 ms
7,836 KB
testcase_11 AC 93 ms
21,828 KB
testcase_12 AC 114 ms
23,136 KB
testcase_13 AC 141 ms
30,876 KB
testcase_14 AC 149 ms
32,360 KB
testcase_15 AC 218 ms
38,616 KB
testcase_16 AC 240 ms
43,832 KB
testcase_17 AC 17 ms
7,776 KB
testcase_18 AC 580 ms
73,512 KB
testcase_19 AC 475 ms
73,456 KB
testcase_20 AC 198 ms
37,520 KB
testcase_21 AC 401 ms
73,988 KB
testcase_22 AC 393 ms
73,020 KB
testcase_23 AC 401 ms
72,976 KB
testcase_24 AC 392 ms
72,088 KB
testcase_25 AC 447 ms
71,900 KB
testcase_26 AC 1 ms
4,376 KB
testcase_27 AC 14 ms
5,896 KB
testcase_28 AC 13 ms
5,900 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<
// >>> SWAG
template <class Handler>
struct SWAG : Handler {
    using Value = typename Handler::Value;
    using Handler::unit; // () -> Value
    using Handler::merge; // (Value,Value) -> Value

    deque<Value> q;
    vector<Value> L,R;

    SWAG() : L(1,unit()), R(1,unit()) {}
    int size() const { return q.size(); }
    Value front() const { return q.front(); }
    Value back() const { return q.back(); }
    Value get() const { return merge(L.back(),R.back()); }
    void setLR() {
        int n = q.size(), m = n/2;
        L.resize(m+1); R.resize(n-m+1);
        rep (i,m) L[i+1] = merge(q[m-1-i],L[i]);
        rep (i,n-m) R[i+1] = merge(R[i],q[m+i]);
    }
    void push_back(Value const& x) {
        q.emplace_back(x);
        R.emplace_back(merge(R.back(),x));
    }
    void pop_back() {
        q.pop_back();
        if ((int)R.size() > 1) {
            R.pop_back();
        } else {
            setLR();
        }
    }
    void push_front(Value const& x) {
        q.emplace_front(x);
        L.emplace_back(merge(x,L.back()));
    }
    void pop_front() {
        q.pop_front();
        if ((int)L.size() > 1) {
            L.pop_back();
        } else {
            setLR();
        }
    }
};
// <<<
struct RangeMax {
    using Value = int;
    constexpr static Value unit() { return -INF; }
    constexpr static Value merge(Value x, Value y) { return max(x,y); }
};

int32_t main() {
    int n,k,m; cin >> n >> k >> m;
    vector<int> a(n); cin >> a;
    vector<int> s(n+1);
    rep (i,n) s[i+1] = s[i] + a[i];

    auto dp = make_v<int,2>(n+1,k+1,-INF);
    dp[0][0] = 0;
    rep (j,k) {
        SWAG<RangeMax> sw0,sw1;
        rep (i,n+1) {
            dp[i][j+1] = max(sw0.get() + s[i], sw1.get() - s[i]);
            sw0.push_back(dp[i][j] - s[i]);
            sw1.push_back(dp[i][j] + s[i]);
            if (sw0.size() > m) sw0.pop_front();
            if (sw1.size() > m) sw1.pop_front();
        }
    }

    cout << dp[n][k] << endl;

}
0