結果

問題 No.3050 Prefix Removal
ユーザー fuppy_kyopro
提出日時 2025-03-07 21:39:02
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 6,243 bytes
コンパイル時間 3,192 ms
コンパイル使用メモリ 220,508 KB
実行使用メモリ 705,912 KB
最終ジャッジ日時 2025-03-07 21:39:20
合計ジャッジ時間 17,752 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 2 WA * 30 MLE * 1 -- * 22
権限があれば一括ダウンロードができます

ソースコード

diff #

/*
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//*/

// #include <atcoder/all>
#include <bits/stdc++.h>

using namespace std;
// using namespace atcoder;

// #define _GLIBCXX_DEBUG
#ifdef LOCAL
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                        \
    cerr << #v << ":";                                      \
    for (int iiiiiiii = 0; iiiiiiii < v.size(); iiiiiiii++) \
        cerr << " " << v[iiiiiiii];                         \
    cerr << endl;
#define DEBUG_MAT(v)                                \
    cerr << #v << endl;                             \
    for (int iv = 0; iv < v.size(); iv++) {         \
        for (int jv = 0; jv < v[iv].size(); jv++) { \
            cerr << v[iv][jv] << " ";               \
        }                                           \
        cerr << endl;                               \
    }
#else
#define DEBUG(x) ;
#define DEBUG_VEC(v) ;
#define DEBUG_MAT(v) ;
#endif
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
    return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template <class S, class T>
ostream &operator<<(ostream &os, pair<S, T> p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}
#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 rrep(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
void YES(bool t = true) {
    cout << (t ? "YES" : "NO") << endl;
}
void Yes(bool t = true) { cout << (t ? "Yes" : "No") << endl; }
void yes(bool t = true) { cout << (t ? "yes" : "no") << endl; }
void NO(bool t = true) { cout << (t ? "NO" : "YES") << endl; }
void No(bool t = true) { cout << (t ? "No" : "Yes") << endl; }
void no(bool t = true) { cout << (t ? "no" : "yes") << endl; }
template <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;
}
template <class T, class U>
T ceil_div(T a, U b) {
    return (a + b - 1) / b;
}
template <class T>
T safe_mul(T a, T b) {
    if (a == 0 || b == 0) return 0;
    if (numeric_limits<T>::max() / a < b) return numeric_limits<T>::max();
    return a * b;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
int popcount(ll t) { return __builtin_popcountll(t); }
vector<int> gen_perm(int n) {
    vector<int> ret(n);
    iota(all(ret), 0);
    return ret;
}
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {0, 0, -1, 1}, dy = {-1, 1, 0, 0};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
struct Setup_io {
    Setup_io() {
        ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
        cout << fixed << setprecision(25);
        cerr << fixed << setprecision(25);
    }
} setup_io;
// constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
// #define mp make_pair

template <typename Semigroup>
struct DisjointSparseTable {
    using F = function<Semigroup(Semigroup, Semigroup)>;
    const F f;
    vector<vector<Semigroup>> st;

    DisjointSparseTable(const vector<Semigroup> v, const F f) : f(f) {

        int b = 0;
        while ((1 << b) <= v.size())
            ++b;
        st.resize(b, vector<Semigroup>(v.size(), Semigroup()));
        for (int i = 0; i < v.size(); i++)
            st[0][i] = v[i];
        for (int i = 1; i < b; i++) {
            int shift = 1 << i;
            for (int j = 0; j < v.size(); j += shift << 1) {
                int t = min(j + shift, (int)v.size());
                st[i][t - 1] = v[t - 1];
                for (int k = t - 2; k >= j; k--)
                    st[i][k] = f(v[k], st[i][k + 1]);
                if (v.size() <= t) break;
                st[i][t] = v[t];
                int r = min(t + shift, (int)v.size());
                for (int k = t + 1; k < r; k++)
                    st[i][k] = f(st[i][k - 1], v[k]);
            }
        }
    }

    Semigroup query(int l, int r) {
        if (l >= --r) return st[0][l];
        int p = 31 - __builtin_clz(l ^ r);
        return f(st[p][l], st[p][r]);
    }
};

signed main() {
    int n, k;
    cin >> n >> k;

    vl a(n);
    rep(i, n) {
        cin >> a[i];
    }

    vl sum(n + 1);
    rep(i, n) {
        sum[i + 1] = sum[i] + a[i];
    }

    vector<pll> sum_i(n + 1);
    rep(i, n + 1) {
        sum_i[i] = {sum[i], i};
    }

    DisjointSparseTable<pll> dst(sum_i, [](pll a, pll b) { return min(a, b); });

    vector<map<int, ll>> dp(n + 1);
    rrep(i, n + 1) {
        if (i >= k) {
            if (dp[i].count(k) == 0) {
                dp[i][k] = 0;
            } else {
                chmax(dp[i][k], 0LL);
            }
        }

        DEBUG(i);

        for (auto [j, v] : dp[i]) {
            DEBUG(pll(j, v));
            if (j == 0) {
                continue;
            }

            int ni;
            if (j == 1) {
                ni = 0;
            } else {
                auto mi = dst.query(j - 1, i);
                ni = mi.second;
            }

            ll add = sum[i] - sum[ni];
            DEBUG(pll(ni, add));
            if (dp[ni].count(j - 1) == 0) {
                dp[ni][j - 1] = -INF;
            }
            chmax(dp[ni][j - 1], dp[i][j] + add * j);
        }
    }

    cout << dp[0][0] << endl;
}
0