Submission #791585

#	Time	Username	Problem	Language	Result	Execution time	Memory
791585		akari	Feast (NOI19_feast)	C++14	0 / 100	61 ms	1952 KiB

feast

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define ii pair<ll,ll>
const ll maxn=2e5+2;

int a[maxn];
ll dp[2002][2006];
ll ans;

int main(){
    int n,k; cin>>n>>k;    
    for (int i=1;i<=n;++i) cin>>a[i];
    for (int j=1;j<=k;++j){
        for (int i=1;i<=n;++i){
            dp[i][j]=max({dp[i-1][j]+a[i], dp[i-1][j-1]+a[i],dp[i][j],dp[i-1][j-1]});
            //cout<<dp[i][j]<<" ";
            ans=max(ans,dp[i][j]);
        }
        //cout<<endl;
    }
    cout<<ans<<endl;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 18
• Subtask 4: 0 / 10
• Subtask 5: 0 / 11
• Subtask 6: 0 / 20
• Subtask 7: 0 / 29