Submission #1296118

#	Time	Username	Problem	Language	Result	Execution time	Memory
1296118		chaitanyamehta	Feast (NOI19_feast)	C++20	59 / 100	1096 ms	7836 KiB

feast

// https://static.oj.uz/problem/16d3e3748d52997353f58d61d6e89b4/statement/41e54ac7d5af210510f0e15513412d0b31cf8ee951506602d2b538eca57ecab0/statement_en.pdf

#include<bits/stdc++.h>
using namespace std;

#define int long long

signed main(){
    ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
    int n , k;
    cin>>n>>k;
    vector<int> a(n+1);
    for(int i = 1 ; i <= n ; i++)cin>>a[i];
    
    
    vector<int> prev(n + 1 , 0) , curr(n + 1 , 0);
    for(int i = 1 ; i<=k;i++){
        int maxx = 0;
        for(int j = 1 ; j<=n;j++){

            // int masx = *max_element(prev.begin() , prev.begin()+j-1);
            maxx = max(maxx , prev[j-1]);

            curr[j]= max(maxx , curr[j-1])+a[j];
        }
        prev = curr;
    }
    // for(int i = 0 ; i <= k ; i++){
    //     for(int j =0;j<=n;j++){
    //         cout<<dp[i][j]<<" ";
    //     }
    //     cout<<"\n";
    // }
    int masx = *max_element(curr.begin() , curr.end());
    // for(int i = 0 ;i <= n ;i++)cout<<curr[i] << " ";
    // cout<<"\n";
    cout<<masx;
}

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