Submission #833146

#	Time	Username	Problem	Language	Result	Execution time	Memory
833146		veehj	Feast (NOI19_feast)	C++17	12 / 100	128 ms	4788 KiB

feast

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

typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (int)a.size()
#define all(x) (x).begin(), (x).end()
int n, k; vector<ll> a={0};

void f(){
    ll ans = 0;
    ll nw = 0;
    for(auto& u : a){
        nw = max((ll)0, nw + u);
        ans = max(ans, nw);
    }
    cout << ans << endl;
    return;
}

int main(){
    cin >> n >> k;
    vector<ll> v;
    for(int i=0; i<n; i++){
        ll x; cin >> x;
        if(x<=0){
            if(a[a.size()-1]<=0) v[v.size()-1]-=x;
            else v.pb(-1*x);
        }
        a.pb(x);
    }
    if(k==1){
        f();
        return 0;
    }
    ll cnt=0;
    for(auto& u : a) if(u>0) cnt+=u;
    cout << cnt << endl;
}

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