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 ll long long
#define db long double
#define ii pair<int, int>
#define fi first
#define se second
const int maxn = 2005;
const ll mod = 111539786;
const db eps = -1e9;
const ll inf = 1e18;
int n, k;
int a[maxn];
ll dp[maxn][maxn];
ll s[maxn];
void solve(){
cin >> n >> k;
int minn = 1e9;;
for(int i=1; i<=n; i++){
cin >> a[i];
minn = min(minn, a[i]);
s[i] = s[i-1] + a[i];
}
for(int i=1; i<=k; i++){
ll max_val = 0;
for(int j=1; j<=n; j++){
dp[i][j] = dp[i][j-1];
dp[i][j] = max(dp[i][j], max_val + s[j]);
max_val = max(max_val, dp[i-1][j] - s[j]);
}
}
if(minn >= 0) dp[k][n] = s[n];
cout << dp[k][n] << "\n";
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int test = 1;
while(test--){
solve();
}
}
# | 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... |