제출 #1327624

#제출 시각아이디문제언어결과실행 시간메모리
1327624ozner77Feast (NOI19_feast)C++17
59 / 100
1095 ms4784 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ll n,k;
    cin>>n>>k;
    vector<ll> V;
    for(int i=0;i<n;i++){
        ll a;
        cin>>a;
        V.push_back(a);
    }
    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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...