This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Os")
#include <bits/stdc++.h>
using namespace std;
const int MN = 2e6+5;
const int INF = 0x3f3f3f3f;
#define int long long
#define pb push_back
#define p make_pair
#define fi first
#define se second
#define pii pair<int,int>
#define f(i,a,b) for (int i = a ; i < b ; i++)
#define f1(i,a,b) for (int i = a ; i > b ; i--)
#define f2(i,a,b) for (int i = a ; i <= b ; i++)
#define FILE(X) \
freopen(#X ".INP","r",stdin); \
freopen(#X ".OUT","w",stdout);
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int random(int l, int r) { return l + rd() % (r - l + 1); }
int a[MN];
int n,k,pos;
int cnt = 0;
int dp[5003][5003];
int pre[MN];
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//FILE(BLUESKY);
bool flag = false;
cin >> n >> k;
for (int i = 1 ; i <= n ; i++) {
cin >> a[i];
pre[i] = pre[i-1] + a[i];
if (a[i] < 0) flag = true,cnt++, pos = i;
}
for (int j = 1; j <= k; ++j){
int cur = 0;
for (int i = 1; i <= n; ++i) {
cur = max(cur, dp[i][j-1] - pre[i]);
dp[i][j] = max(dp[i-1][j], cur + pre[i]);
}
}
cout << dp[n][k];
return 0;
}
Compilation message (stderr)
feast.cpp: In function 'int main()':
feast.cpp:30:10: warning: variable 'flag' set but not used [-Wunused-but-set-variable]
30 | bool flag = false;
| ^~~~
# | 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... |