# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305063 | 2020-09-22T13:52:00 Z | luciocf | Feast (NOI19_feast) | C++14 | 143 ms | 8696 KB |
#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 = -inf, fim = inf, best = -inf; while (ini <= fim) { ll mid = (ini+fim)/2ll; if (qtd(mid) > k) fim = mid-1; else best = mid, ini = mid+1; } qtd(best); printf("%lld\n", dp[n].ff - 1ll*k*best); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 109 ms | 8312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 92 ms | 8312 KB | Output is correct |
2 | Correct | 92 ms | 8568 KB | Output is correct |
3 | Correct | 92 ms | 8312 KB | Output is correct |
4 | Incorrect | 89 ms | 8440 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 141 ms | 8440 KB | Output is correct |
2 | Correct | 140 ms | 8312 KB | Output is correct |
3 | Correct | 139 ms | 8440 KB | Output is correct |
4 | Correct | 141 ms | 8344 KB | Output is correct |
5 | Correct | 138 ms | 8440 KB | Output is correct |
6 | Correct | 142 ms | 8444 KB | Output is correct |
7 | Correct | 142 ms | 8440 KB | Output is correct |
8 | Correct | 139 ms | 8440 KB | Output is correct |
9 | Correct | 143 ms | 8696 KB | Output is correct |
10 | Correct | 140 ms | 8440 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 109 ms | 8312 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |