제출 #199555

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
199555		ArthurQ	수열 (APIO14_sequence)	C++14	49 / 100	2085 ms	83560 KiB

sequence

#include <bits/stdc++.h>

#define MAXN 100005
#define MAXK 205

using namespace std;

typedef long long int ll;

vector<ll> dpprev, dpnow;

int n, k, arr[MAXN], dprev[MAXN][MAXK], layer;
ll s[MAXN];

void DCT(int a, int b, int op1, int op2) {
	if (a > b) return;
	int mid = (a + b) >> 1;
	int theop = op1;
	for (int op = op1; op <= min(mid-1, op2); op++)
		if (dpnow[mid-1] < dpprev[op-1] + s[op] * (s[mid] - s[op]))
			theop = op,
			dpnow[mid-1] = dpprev[op-1] + s[op] * (s[mid] - s[op]),
			dprev[mid][layer] = theop;
	DCT(a, mid-1, op1, theop), DCT(mid+1, b, theop, op2);	
}

int main() {
	scanf("%d %d", &n, &k);
	for (int i = 1; i <= n; i++)
		scanf("%d ", &arr[i]);
	s[0] = 0;
	for (int i = 1; i <= n; i++)
		s[i] = s[i-1] + arr[i];
		
	for (int i = 1; i <= n; i++)
		dpprev.push_back(0);
	
	for (layer = 1; layer <= k; layer++) {
		dpnow.clear();
		for (int i = 1; i <= n; i++)
			dpnow.push_back(0);
		DCT(layer, n, layer, n-1);
		dpprev = dpnow;
	}
	
	printf("%lld\n", dpnow.back());
	bool ap = 0;
	int x = n;
	layer--;
	while (dprev[x][layer]) {
		if (ap) printf(" ");
		printf("%d", dprev[x][layer]);
		ap = 1;
		x = dprev[x][layer];
		layer--;
	}
	printf("\n");
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:28:7: 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:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d ", &arr[i]);
   ~~~~~^~~~~~~~~~~~~~~~

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