제출 #7740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
7740		gs14004	수열 (APIO14_sequence)	C++98	0 / 100	0 ms	131072 KiB

sequence

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long lint;

int n,k;
lint dp[100005][205],a[100005];
int track[100005][205];

int main(){
    int t;
    scanf("%d %d",&n,&k);
    for (int i=0; i<n; i++) {
        scanf("%d",&t);
        a[i+1] = a[i] + t;
    }
    for (int t=1; t<=k; t++) {
        for (int i=n; i>=1; i--) {
            lint res = 0;
            for (int j=i+1; j<=n; j++) {
                lint piv = dp[j][(t-1)%2] + (a[j-1] - a[i-1])*(a[n] - a[j-1]);
                if(res < piv){
                    res = piv;
                    track[i][t] = j;
                }
            }
            dp[i][t%2] = res;
        }
    }
    printf("%lld\n",dp[1][k%2]);
    int pos1 = 1, pos2 = k;
    for (int i=0; i<k; i++) {
        printf("%d ",track[pos1][pos2]-1);
        pos1 = track[pos1][pos2];
        pos2--;
    }
}

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