Submission #837885

#	Time	Username	Problem	Language	Result	Execution time	Memory
837885		Ahmed57	Feast (NOI19_feast)	C++17	100 / 100	796 ms	18764 KiB

feast

#include<bits/stdc++.h>
using namespace std;
long long n,k;
long long arr[300001];
pair<long long,long long> check(long long x){
    priority_queue<pair<long long,long long>> q;
    q.push({0,0});
    pair<long long,long long> ans = {0,0};
    for(int i = 0;i<n;i++){
        long long val = arr[i]+q.top().first-x;
        long long sec = (q.top().second)+1;
        pair<long long,long long> fawzya = {val,sec};
        ans = max(ans,fawzya);
        fawzya = ans;
        q.push({(-arr[i])+fawzya.first,fawzya.second});
        ans = max(ans,make_pair(fawzya.first,fawzya.second));
    }
    return ans;
}
int main(){
    cin>>n>>k;
    long long ans = 0;
    for(int i = 0;i<n;i++){
        cin>>arr[i];
        if(arr[i]>0)ans+=arr[i];
        if(i)arr[i]+=arr[i-1];
    }
    long long l = 0 , r = 1e16;
    while(l<=r){
        long long mid = (l+r)/2;
        pair<long long ,long long> an = check(mid);
        if(an.second>=k){
            ans =an.first+k*mid;
            l = mid+1;
        }else {
            r = mid-1;
        }
    }
    cout<<ans<<endl;
	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: 29 / 29