제출 #833130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833130		veehj	Feast (NOI19_feast)	C++17	4 / 100	1071 ms	5000 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;

void f(){
    vector<ll> p=a;
    for(int i=1; i<n; i++) p[i]+=p[i-1];
    ll ans=0;
    for(int i=0; i<n; i++){
        for(int j=0; j<i; j++){
            ans=max(ans, p[i]-p[j]);
        }
    }
    cout << ans << endl;
    return;
}

int main(){
    cin >> n >> k;
    for(int i=0; i<n; i++){
        ll x; cin >> x;
        a.pb(x);
    }
    if(k==1) f();
    else{
        ll cnt=0;
        for(int i=0; i<n; i++) if(a[i]>0) cnt+=a[i];
        cout << cnt << endl;
    }
}

• Subtask 1: 4 / 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