제출 #37525

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

sequence

#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

typedef long long ll;

const ll inf = (ll)1e9 + 7;
const int N = (int)1e5 + 2;

int n,k,id;
int a[N],pr[N][201],o;

int p[N];
ll mx;
ll dp[N][2];

ll calc (int r,int l) {
        return (p[r] - p[l]) * 1ll * (p[n] - p[r]);
}
void compute (int k,int l,int r,int L,int R) {
        if (l > r)
                return;

        int m = (l + r) >> 1;

        for (int i = L; i <= min(m,R); i ++) {
                ll now = dp[i - 1][(k - 1) & 1] + calc(m,i - 1);
                if (now >= dp[m][k & 1])
                        dp[m][k & 1] = now,pr[m][k] = i;
        }
        if (mx <= dp[m][k & 1] && m != n)
                mx = dp[m][k & 1],id = m;

        compute (k,l,m - 1,L,pr[m][k]);
        compute (k,m + 1,r,pr[m][k],R);
}
int main () {
        scanf ("%d%d", &n,&k);

        o = k;

        for (int i = 1; i <= n; i ++) {
                scanf ("%d", &a[i]);
                p[i] = p[i - 1] + a[i];
        }

        for (int i = 1; i <= k; i ++)
                compute (i,i,n,i,n - 1);

        printf("%lld\n", mx);

        deque<int> dq;

        while (id > 0 && k > 0) {
                cout << id << " ";
                id = pr[id][k] - 1;
                k --;
        }
}
/**
7 3
4 1 3 4 0 2 3
**/

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

sequence.cpp: In function 'int main()':
sequence.cpp:44:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d%d", &n,&k);
                              ^
sequence.cpp:49:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf ("%d", &a[i]);
                                    ^

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