제출 #64345

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64345		qkxwsm	수열 (APIO14_sequence)	C++17	100 / 100	591 ms	82436 KiB

sequence

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <bits/stdc++.h>
#include <memory.h>
 
typedef long long ll;
typedef unsigned long long llu;
typedef double lf;
typedef long double llf;
typedef unsigned int uint;
 
using namespace std;
 
const int N_ = 100500, K_ = 205;
int N, K, A[N_];
ll Table[2][N_], S[N_];
int opt[K_][N_];
 
void solve (int k, int i) {
    if(k == 1) return;
    solve(k - 1, opt[k][i] - 1);
    printf("%d ", opt[k][i] - 1);
}
 
int main() {
    scanf("%d%d", &N, &K);
    for(int i = 1; i <= N; i++) scanf("%d", A+i), S[i] = S[i-1] + A[i];
 
    for(int i = 1; i <= N; i++) Table[1][i] = S[i] * (S[N] - S[i]);
    for(int k = 2; k <= K+1; k++) {
        ll *now = Table[k&1], *prev = Table[~k&1];
        for(int i = 1; i <= N; i++) now[i] = -1, opt[k][i] = -1;
        for(int i = k; i <= N; i++) {
            ll vp = -1;
            for(int j = max(max(opt[k-1][i], opt[k][i-1]), k); j <= i; j++) {
                ll v = prev[j-1] + (S[i] - S[j-1]) * (S[N] - S[i]);
                if(v >= now[i]) now[i] = v, opt[k][i] = j;
                if(N > 10000) {
                    if(v < vp) break;
                    vp = v;
                }
            }
        }
    }
 
    printf("%lld\n", Table[~K&1][N]);
    solve(K+1, N);
 
    return 0;
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &K);
     ~~~~~^~~~~~~~~~~~~~~~
sequence.cpp:30:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= N; i++) scanf("%d", A+i), S[i] = S[i-1] + A[i];
                                 ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

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