제출 #394478

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
394478		rocks03	Feast (NOI19_feast)	C++14	71 / 100	1083 ms	6676 KiB

feast

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define debug(x) cout << #x << ": " << x << " "
#define nl cout << "\n"
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 3e5+100;
int N, K, a[MAXN];
ll dp[MAXN];

void solve(){
    cin >> N >> K;
    int cnt = 0;
    rep(i, 1, N + 1){
        cin >> a[i];
        if(a[i] < 0) cnt++;
    }
    if(cnt <= 1) K = min(K, 2);
    rep(k, 1, K + 1){
        ll s = 0, mx = 0;
        rep(i, 1, N + 1){
            s += a[i];
            s = max(s, dp[i]);
            mx = max(mx, s);
            dp[i] = mx;
        }
    }
    cout << dp[N];
}
 
int main(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr);
    solve();
    return 0;
}

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