Submission #8110

# Submission time Handle Problem Language Result Execution time Memory
8110 2014-08-30T09:40:46 Z qja0950 Split the sequence (APIO14_sequence) C++
100 / 100
1628 ms 91524 KB
#include <stdio.h>

#define MAXK 222
#define MAXN 101101
typedef long long ll;

int N, K;
int Number[MAXN];
ll Sum[MAXN];

void INPUT() {
	scanf("%d %d", &N, &K);
	for(int i=1; i<=N; i++) {
		scanf("%d", &Number[i]);
		Sum[i] = Sum[i-1] + (ll)Number[i];
	}
}

int Mom[MAXK][MAXN];
ll Dy[2][MAXN];
void Get(int k, int a, int b, int ga, int gb) {
	if(a>b) return;
	int now  = k%2;
	int past = 1 - now;
	int m = (a + b)/2;
	ll max = -1;
	int maxp = 0;
	for(int i=ga; i<=gb; i++) {
		if(i>=m) break;
		ll current = Dy[past][i] + Sum[i]*(Sum[m] - Sum[i]);
		if(max<current) {
			max  = current;
			maxp = i ;
		}
	}
	 Dy[now][m] = max;
	Mom[k  ][m] = maxp;
	Get(k, a, m-1, ga, maxp);
	Get(k, m+1, b, maxp, gb);
}
void Find(int k, int n) {
	if(k==1) return;
	Find(k-1, Mom[k][n]);
	printf("%d ", Mom[k][n]);
}
int main() {
	INPUT();
	for(int i=2; i<=K+1; i++)
		Get( i, i, N, i-1, N-1 );
	printf("%lld\n", Dy[1-K%2][N]);
	Find(K+1, N);
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994
# Verdict Execution time Memory Grader output
1 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931
# Verdict Execution time Memory Grader output
1 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 490686959791 == 490686959791
# Verdict Execution time Memory Grader output
1 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 8 ms 91524 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Correct 8 ms 91524 KB Output is correct - contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 8 ms 91524 KB Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 4 ms 91524 KB Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664
# Verdict Execution time Memory Grader output
1 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 64 ms 91524 KB Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 91524 KB Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 84 ms 91524 KB Output is correct - contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 80 ms 91524 KB Output is correct - contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 80 ms 91524 KB Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 52 ms 91524 KB Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 80 ms 91524 KB Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 88 ms 91524 KB Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798
# Verdict Execution time Memory Grader output
1 Correct 36 ms 91524 KB Output is correct - contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 32 ms 91524 KB Output is correct - contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 868 ms 91524 KB Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 20 ms 91524 KB Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 1628 ms 91524 KB Output is correct - contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 980 ms 91524 KB Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 888 ms 91524 KB Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 640 ms 91524 KB Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 872 ms 91524 KB Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 1080 ms 91524 KB Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845