Submission #332434

#	Time	Username	Problem	Language	Result	Execution time	Memory
332434		vitkishloh228	Split the sequence (APIO14_sequence)	C++14	0 / 100	18 ms	1900 KiB

sequence

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define int long long
int32_t main() {
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    vector<int> pr(n + 1);
    for (int i = 0; i < n; ++i) pr[i + 1] = pr[i] + a[i];
    int needsum = pr[n] / (k + 1);
    int it = 0;
    int cursum = 0;
    int ans = 0;
    vector<int> ans1;
    for (int i = 0; i < k; ++i) {
        int pos1 = upper_bound(pr.begin(), pr.end(), needsum + cursum) - pr.begin() - 1;
        //cout << pr[pos1] << endl;
        ans += ((pr[pos1] - pr[it]) * (pr[n] - pr[pos1]));
        ans1.push_back(pos1);
        it = pos1 ;
        cursum = pr[pos1];
    }
    cout << ans << '\n';
    for (auto elme : ans1) cout << elme << ' ';
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29