# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676480 | penguin133 | Feast (NOI19_feast) | C++17 | 152 ms | 15100 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 pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#define getchar_unlocked _getchar_nolock
int n, k, A[300005];
pi dp[300005][2];
int ans;
int c(int x){
dp[0][0] = {0, 0};
dp[0][1] = {-1e18, 0};
for(int i=1;i<=n;i++){
dp[i][0] = max(dp[i-1][0], dp[i-1][1]);
dp[i][1] = max({make_pair(dp[i-1][0].fi + A[i] - x, dp[i-1][0].se + 1), make_pair(dp[i-1][1].fi + A[i], dp[i-1][1].se)});
}
pi tmp = max(dp[n][0], dp[n][1]);
if(tmp.se <= k)ans = max(ans, tmp.fi + tmp.se * x);
cerr << x << " " << tmp.fi << " " << tmp.se << '\n';
return tmp.se;
}
void solve(){
cin >> n >> k;
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... |