# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240565 | arnold518 | Feast (NOI19_feast) | C++14 | 175 ms | 15224 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;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 3e5;
const ll INF = 1e13;
int N, K;
ll A[MAXN+10];
pll dp1[MAXN+10], dp2[MAXN+10];
ll ans;
int solve(ll lambda)
{
int i, j;
dp1[0]={-INF, 0};
dp2[0]={0, 0};
for(i=1; i<=N; i++)
{
if(dp1[i-1].first>dp2[i-1].first-lambda) dp1[i]={dp1[i-1].first+A[i]*2, dp1[i-1].second};
else dp1[i]={dp2[i-1].first-lambda+A[i]*2, dp2[i-1].second+1};
dp2[i]=max(dp1[i-1], dp2[i-1]);
}
ans=max(dp1[N].first, dp2[N].first);
if(dp1[N].first>dp2[N].first) return dp1[N].second;
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... |