제출 #344903

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344903		spike1236	Split the sequence (APIO14_sequence)	C++14	71 / 100	2072 ms	88828 KiB

sequence

#include <bits/stdc++.h>

std::vector <int64_t> pref;
std::vector <std::vector <int64_t> > dp;
std::vector <std::vector <int> > opt;

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

int main() {
    int n, K;
    scanf("%d %d\n", &n, &K);
    pref.resize(n + 1);
    dp.resize(n + 1);
    opt.resize(n + 1);
    for(int i = 0; i <= n; ++i)
        dp[i].resize(2), opt[i].resize(K + 1);
    for(int i = 1; i <= n; ++i) {
        int x;
        scanf("%d", &x);
        pref[i] = pref[i - 1] + x;
    }
    for(int i = 1; i <= K; ++i)
        calc(i, i + 1, n, i, n);
    printf("%I64ld\n", dp[n][K & 1]);
    int pos = n;
    for(int i = K; i > 0; --i)
        pos = opt[pos][i], printf("%d ", pos);
    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:9:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    9 |     int m = l + r >> 1;
      |             ~~^~~
sequence.cpp: In function 'int main()':
sequence.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%d %d\n", &n, &K);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~
sequence.cpp:34:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   34 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~

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