# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
831404 | BamshooT | Feast (NOI19_feast) | C++14 | 125 ms | 12752 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 <iostream>
#define ll long long
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define fi first
#define se second
#define inf 1e18
using namespace std;
typedef pair<ll, int> li;
const int N = 3e5 + 9;
int n, k;
ll pre[N], a[N], ans;
li dp[N];
void maximize(li &a, li b){
if (a.fi < b.fi) a = b;
if (a.fi == b.fi) a = max(a, b);
}
li calc(ll cost){
//FOR(i, 1, n) dp[i] = {pre[i] - cost, 1};
li best = {0, 0};
for (int i = 1; i <= n; ++i) {
dp[i] = dp[i-1];
maximize(dp[i], {pre[i] + best.fi - cost, best.se + 1});
maximize(best, {dp[i].fi - pre[i], dp[i].se});
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... |