| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1327632 | ozner77 | Feast (NOI19_feast) | C++17 | 1096 ms | 3696 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll caca,k;
cin>>caca>>k;
vector<ll> V;
ll xd;
cin>>xd;
for(int i=1;i<caca;i++){
ll a;
cin>>a;
if(a<0 && xd<0){
xd+=a;
}else if(a>0 && xd>0){
xd+=a;
}else{
V.push_back(xd);
xd=a;
}
}
ll n=V.size();
V.push_back(xd);
n++;
vector<ll> dp(k+1),dp2(k+1);
for(int i=0;i<=k;i++){
dp[i]=0;
dp2[i]=-1e18;
}
for(int i=0;i<n;i++){
for(int j=k;j>=1;j--){
dp2[j]=max(dp2[j]+V[i],dp[j-1]+V[i]);
dp[j]=max(dp2[j],dp[j]);
}
}
cout<<dp[k]<<"\n";
}| # | 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... | ||||
