Submission #135201

#	Time	Username	Problem	Language	Result	Execution time	Memory
135201		pedro_sponchiado	Split the sequence (APIO14_sequence)	C++17	0 / 100	952 ms	25396 KiB

sequence

#include<bits/stdc++.h>
using namespace std;
const long long int INF=112345678912345678;
const int maxn=10010;
const int maxk=210;
int n, d;
int a[maxn];

long long int parc[maxn], parc_2[maxn];
long long int s_2[maxn];
long long int S_2(int i, int j){ 
	return s_2[j]-s_2[i]-parc[i]*(parc[j]-parc[i]);	
}
	
long long int dp[maxn][maxk];
int opt[maxn][maxk];


int main(){
	scanf("%d %d", &n, &d);
	for(int i=1; i<=n; i++){
		scanf("%d", &a[i]);
		parc[i]=parc[i-1]+a[i];
		parc_2[i]=parc_2[i-1]+a[i]*a[i];
		s_2[i]=(parc[i]*parc[i]-parc_2[i])/2;
	}
	
	for(int i=1; i<=n; i++) dp[i][0]=s_2[i];
	
	for(int k=1; k<=d; k++){
		for(int i=1; i<=n; i++){
			dp[i][k]=INF;
			if(k>=i)continue;
			
			for(int l=1; l<i; l++){
				if(dp[i][k]>dp[l][k-1]+S_2(l+1, i)){
					dp[i][k]=dp[l][k-1]+S_2(l+1, i);
					opt[i][k]=l;
				}
			}
			
		//	printf("dp[%d][%d]=%lld\n", i, k, dp[i][k]);
		}	 
	}
	
	printf("%lld\n", s_2[n]-dp[n][d]); 
	
	int at=n;
	vector<int> aux;
	for(int i=d; i>=1; i--){
		aux.push_back(opt[at][i]);
		at=opt[at][i];	
	}
	for(int i=d-1; i>=0; i--) printf("%d ", aux[i]);
	
	return 0;	
}

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:20:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &d);
  ~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:22:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

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