# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938941 | Lilypad | Feast (NOI19_feast) | C++14 | 206 ms | 12876 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define pii pair<ll,ll>
#define fi first
#define se second
const int MAXN= 3e5+5;
int N, K, A[MAXN], op;
pii dp[MAXN];
ll pref[MAXN];
// A : ambil K gratis
// B : ambil berapapun bayar
ll f(ll cost) {
pii m;
for (int i=1;i<=N;i++) {
dp[i] = max(dp[i-1], {m.fi+pref[i]-cost,m.se-1});
m = max(m,{dp[i].fi-pref[i],dp[i].se});
}
op = -dp[N].se;
return dp[N].fi;
}
signed main() {
cin>>N>>K;
for (int i=1;i<=N;i++) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |