# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305060 | luciocf | Feast (NOI19_feast) | C++14 | 199 ms | 11600 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>
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<ll, int> pii;
const int maxn = 3e5+10;
const ll inf = 6e14+10;
int n;
int a[maxn];
ll pref[maxn];
pii dp[maxn];
int qtd(ll c)
{
pii mx = {0, 0};
for (int i = 1; i <= n; i++)
{
mx = max(mx, {dp[i-1].ff - pref[i-1], dp[i-1].ss});
dp[i] = max(dp[i-1], {pref[i] + mx.ff - c, mx.ss+1});
}
return dp[n].ss;
}
int main(void)
{
int k;
scanf("%d %d", &n, &k);
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
pref[i] = pref[i-1]+1ll*a[i];
}
ll ini = 0, fim = inf, best = inf;
while (ini <= fim)
{
ll mid = (ini+fim)/2ll;
if (qtd(mid) > k) ini = mid+1;
else best = mid, fim = mid-1;
}
qtd(best);
printf("%lld\n", dp[n].ff + 1ll*dp[n].ss*best);
}
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... |