제출 #1158746

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1158746		Hanksburger	Feast (NOI19_feast)	C++20	22 / 100	23 ms	5572 KiB

feast

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define int long long
int a[300005], dp[300005];
vector<int> vec;
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, k, sum=0, mx=0;
    cin >> n >> k;
    for (int i=1; i<=n; i++)
    {
        cin >> a[i];
        if (dp[i-1]+a[i]<0)
        {
            vec.push_back(mx);
            dp[i]=mx=0;
        }
        else
        {
            dp[i]=dp[i-1]+a[i];
            mx=max(mx, dp[i]);
        }
    }
    vec.push_back(mx);
    sort(vec.begin(), vec.end());
    for (int i=max(0LL, (int)vec.size()-k); i<vec.size(); i++)
        sum+=vec[i];
    cout << sum;
}

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