제출 #40510

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
40510		mohammad_kilani	수열 (APIO14_sequence)	C++14	22 / 100	3 ms	1116 KiB

sequence

#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define oo 1000000000
const double PI = acos(-1);
const int N = 10010 , K = 201;
int arr[N] , n , k;
long long dp[N][K] , sum[N] , last[N];
 
void buildpath(int i,int j){
	if(i == n - 1 || j == k)
		return;
	for(int l=i+1;l<n;l++){
		if(dp[i][j] == dp[l][j+1] + (sum[l] - sum[i]) * (sum[n] - sum[l])){
			printf("%d ",l);
			buildpath(l,j+1);
			return;
		}
	}
}
 
int main(){
	scanf("%d%d",&n,&k);
	for(int i=0;i<n;i++){
		scanf("%d",&arr[i]);
		sum[i+1] = sum[i] + arr[i];
	}
	for(int i=0;i<k;i++)
		dp[n-1][i] = -1e17;
	for(int i=n-2;i>=0;i--){
		for(int j=0;j<k;j++){
			bool akbar = -1;
			last[i] = -1e18;
			for(int l=i+1;l<n;l++){
				last[l] = dp[l][j+1] + (sum[l] - sum[i]) * (sum[n] - sum[l]);
				if(akbar != -1 && last[l] > last[l-1]) assert(l - akbar <= 50);
				if(akbar == -1 && last[l] < last[l-1]) akbar = l;
				dp[i][j] = max(dp[i][j],dp[l][j+1] + (sum[l] - sum[i]) * (sum[n] - sum[l]));
			}
		}
	}
	cout << dp[0][0] << endl;
 	buildpath(0,0);
 	puts("");
 	return 0;
}

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

sequence.cpp: In function 'int main()':
sequence.cpp:36:14: warning: comparison of constant '-1' with boolean expression is always true [-Wbool-compare]
     if(akbar != -1 && last[l] > last[l-1]) assert(l - akbar <= 50);
              ^
sequence.cpp:37:14: warning: comparison of constant '-1' with boolean expression is always false [-Wbool-compare]
     if(akbar == -1 && last[l] < last[l-1]) akbar = l;
              ^
sequence.cpp:23:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
                     ^
sequence.cpp:25:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&arr[i]);
                      ^

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