제출 #407125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
407125		dxz05	수열 (APIO14_sequence)	C++14	0 / 100	12 ms	1588 KiB

sequence

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define revall(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;

const int M = 5222;

int a[N];
int pref[N];

int get(int l, int r){
    return pref[r] - pref[l - 1];
}

pair<ll, int> calc(int l, int r){
    if (l == r) return MP(0, 0);
    ll ans = 0;
    int ind = l;
    for (int i = l; i < r; i++){
        ll cur = 1ll * get(l, i) * get(i + 1, r);
        if (cur > ans) ans = cur, ind = i;
    }
    return MP(ans, ind);
}

void solve(int TC) {
    int n, k;
    cin >> n >> k;

    for (int i = 1; i <= n; i++){
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }

    set<pair<pair<ll, int>, pair<int, int>>> s = {MP(calc(1, n), MP(1, n))};

    ll ans = 0;
    vector<int> v;

    while (k--){
        auto x = *s.rbegin();
        int i = x.first.second, l = x.second.first, r = x.second.second;

        ans += x.first.first;
        v.push_back(i);

        s.erase(x);
        s.insert(MP(calc(l, i), MP(l, i)));
        s.insert(MP(calc(i + 1, r), MP(i + 1, r)));
    }

    cout << ans << endl;
    for (int i : v) cout << i << ' ';

}


int main() {
    startTime = clock();
    cin.tie(nullptr); cout.tie(nullptr);
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    //  cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

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