제출 #344863

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344863		spike1236	수열 (APIO14_sequence)	C++14	71 / 100	2013 ms	90092 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>


const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 1e5 + 10;
ll a[MAXN];
ll pref[MAXN];
ll dp[MAXN][2];
int opt[MAXN][220];
int n, k;

void calc(int k, int l = 1, int r = n, int optl = 1, int optr = n) {
    if(l > r) return;
    int m = l + r >> 1;
    dp[m][k & 1] = -1e18;
    opt[m][k] = optl;
    for(int i = optl; i <= min(m - 1, optr); ++i) {
        ll cur = dp[i][(k & 1) ^ 1] + pref[i] * (pref[m] - pref[i]);
        if(cur > dp[m][k & 1]) {
            dp[m][k & 1] = cur;
            opt[m][k] = i;
        }
    }
    calc(k, l, m - 1, optl, opt[m][k]);
    calc(k, m + 1, r, opt[m][k], optr);
}


void solve() {
    cin >> n >> k;
    for(int i = 1; i <= n; ++i) cin >> a[i], pref[i] = pref[i - 1] + a[i];
    for(int i = 1; i <= k; ++i)
        calc(i);
    veci ans;
    int pos = n;
    for(int i = k; i > 0; --i)
        pos = opt[pos][i], ans.pb(pos);
    reverse(all(ans));
    cout << dp[n][k & 1] << '\n';
    for(auto it : ans) cout << it << ' ';
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    ///cin >> T;
    while(T--) solve(), cout << '\n';
    return 0;
}
/**
7 3
4 1 3 4 0 2 3
*/

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'void calc(int, int, int, int, int)':
sequence.cpp:33:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   33 |     int m = l + r >> 1;
      |             ~~^~~

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