제출 #733387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
733387		Alihan_8	수열 (APIO14_sequence)	C++17	0 / 100	2078 ms	4700 KiB

sequence

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define pb push_back
#define ln '\n'
#define int long long

template <class _T>
bool chmin(_T &x, const _T &y){
    bool flag = false;
    if ( x > y ){
        x = y; flag |= true;
    }
    return flag;
}

template <class _T>
bool chmax(_T &x, const _T &y){
    bool flag = false;
    if ( x < y ){
        x = y; flag |= true;
    }
    return flag;
}

const int N = 1e4 + 1, inf = 1e15 + 1;

int dp[2][N], par[202][N], K;

vector <int> pref;

int cost(int l, int r){
    return (pref[r] - pref[l - 1]) * (pref.back() - pref[r]);
}

void DAC(int x, int y){
    if ( x > y ) return;
    int md = (x + y) >> 1;
    pair <int,int> Mx = {0, 0};
    for ( int i = 0; i + 1 <= md; i++ ){
        chmax(Mx, pair <int,int> {dp[0][i] + cost(i + 1, md), i});
    }
    par[K][md] = Mx.second;
    dp[1][md] = Mx.first;
    DAC(x, md - 1), DAC(md + 1, y);
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    pref.resize(n + 1);
    for ( int i = 0; i < n; i++ ){
        pref[i + 1] = pref[i] + p[i];
    }
    k++;
    memset(dp[1], 0, sizeof(dp[1]));
    for ( int i = 0; i < k; i++ ){
        swap(dp[1], dp[0]);
        K = i + 1;
        DAC(1, n);
    }
    cout << dp[1][n] << ln;
    vector <int> res;
    int it = n;
    while ( k > 0 ){
        it = par[k--][it];
        if ( it ) res.pb(it);
    }
    reverse(all(res));
    for ( auto i: res ){
        cout << i << ' ';
    }

    cout << '\n';
}

/*
7 3
4 1 3 4 0 2 3
*/

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