Submission #135190

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

sequence

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

long long int parc[maxn], parc_2[maxn];
long long int S_2[maxn][maxn];
//long long int S_2(int i, int j){ 
	
long long int dp[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];
	}	
		
	for(int i=1; i<=n; i++){
		for(int k=i; k<=n; k++){
			S_2[i][k]= (parc[k]-parc[i-1])*(parc[k]-parc[i-1])-parc_2[k]+parc_2[i-1];
		}
	}
	
	for(int i=1; i<=n; i++) dp[i][0]=S_2[1][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++){
				dp[i][k]=min(dp[i][k], dp[l][k-1]+S_2[l+1][i]);	
			}
			
		//	printf("dp[%d][%d]=%lld\n", i, k, dp[i][k]);
		}
		 
	}
	
	printf("%lld/2", S_2[1][n]-dp[n][d]); 
	return 0;	
}

Compilation message (stderr)

sequence.cpp: In function 'int main()':
sequence.cpp:16: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:18: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