結果
| 問題 | No.1117 数列分割 |
| ユーザー |
 Shuz*
|
| 提出日時 | 2020-07-17 22:49:50 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
MLE
|
| 実行時間 | - |
| コード長 | 7,192 bytes |
| コンパイル時間 | 2,366 ms |
| コンパイル使用メモリ | 189,632 KB |
| 実行使用メモリ | 409,956 KB |
| 最終ジャッジ日時 | 2024-05-07 11:33:13 |
| 合計ジャッジ時間 | 12,645 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | MLE | - |
| testcase_01 | AC | 142 ms
195,840 KB |
| testcase_02 | AC | 142 ms
195,840 KB |
| testcase_03 | WA | - |
| testcase_04 | AC | 1,026 ms
200,700 KB |
| testcase_05 | AC | 141 ms
195,840 KB |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | TLE | - |
| testcase_12 | TLE | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
ソースコード
#include <bits/stdc++.h>
using namespace std;
// Define
using 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 second
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;
}
// 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")
// Math
inline 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);
}
vector<ll> rev(vector<ll> a) {
vector<ll> b(len(a));
rep(i, len(a)) b[a[i]] = i;
return b;
}
vector<ll> mul(vector<ll> a, vector<ll> b) {
vector<ll> c(len(a));
rep(i, len(a)) c[i] = b[a[i]];
return c;
}
struct UshiTree {
using Type = int;
Type unit = -inf;
function<Type(Type, Type)> comb = [](Type left, Type right) {
return max(left, right);
};
static const ll n = 1 << 12;
vector<Type> node;
UshiTree() : node(2 * n - 1, unit) {}
inline void update(ll a, Type x) {
ll i = n - 1 + a;
node[i] = x;
while (i != 0) {
i = (i - 1) / 2;
node[i] = comb(node[i * 2 + 1], node[i * 2 + 2]);
}
}
inline Type result(ll a, ll b, ll i = 0, ll l = 0, ll r = n) {
Type res = unit;
if (b <= l or r <= a) return res;
if (a <= l and r <= b) {
return comb(node[i], res);
} else {
return comb(result(a, b, i * 2 + 1, l, (l + r) / 2),
result(a, b, i * 2 + 2, (l + r) / 2, r));
}
}
};
UshiTree seg[3001][2];
signed main() {
ll N, M, K;
cin >> N >> K >> M;
ll A[N + 1] = {};
pvector<ll> V;
rep(i, N) cin >> A[i + 1];
rep(i, N) A[i + 1] += A[i];
rep(i, N + 1) V.pb({A[i], i});
sort(all(V));
ll id[N + 1];
rep(i, N + 1) id[V[i].se] = i;
ll DP[N + 1][K + 1];
rep(i, N + 1) rep(j, K + 1) DP[i][j] = -inf;
DP[0][0] = 0;
seg[0][0].update(id[0], -A[0]);
seg[0][1].update(id[0], A[0]);
rep(i, N) {
rep(j, K) {
if (i - M >= 0) {
seg[j][0].update(id[i - M], -inf);
seg[j][1].update(id[i - M], -inf);
}
DP[i + 1][j + 1] =
max(seg[j][0].result(0, id[i + 1] + 1) + A[i + 1],
seg[j][1].result(id[i + 1], 3001) - A[i + 1]);
seg[j + 1][0].update(id[i + 1], DP[i + 1][j + 1] - A[i + 1]);
seg[j + 1][1].update(id[i + 1], DP[i + 1][j + 1] + A[i + 1]);
}
}
cout << DP[N][K] << rt;
}