| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1368417 | 12345678 | Feast (NOI19_feast) | C++17 | 12 ms | 26864 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=2e3+5;
ll n, k, a[nx], qs[nx], dp[nx][nx];
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>k;
for (int i=1; i<=n; i++) cin>>a[i], qs[i]=qs[i-1]+a[i];
for (int i=1; i<=k; i++)
{
ll mx=0;
for (int j=1; j<=n; j++)
{
mx=max(mx, dp[i-1][j]-qs[j]);
dp[i][j]=max(dp[i][j-1], mx+qs[j]);
// cout<<"debug "<<i<<' '<<j<<' '<<dp[i][j]<<'\n';
}
}
cout<<dp[k][n];
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
