oj.uz

Submission #6890

# Submission time Handle Problem Language Result Execution time Memory
6890 2014-07-09T06:27:18 Z qja0950 Split the sequence (APIO14_sequence) C++
100 / 100
 668 ms 93500 KB 
#include <stdio.h>

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

int N, K;
int A[MAXN];
int S[MAXN];

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

long long D[2][MAXN];
int Mom[MAXK][MAXN];
long long Stack[3][MAXN];
int Stackp;
bool MyOperator(ll Linea[], ll Lineb[]) {
	ll Line[3][2];
	for(int i=0; i<3; i++) {
		Line[i][0]=Linea[i];
		Line[i][1]=Lineb[i];
	}
	ll temp1=(ll)(Line[0][1]-Line[1][1])*(ll)(Line[2][0]-Line[1][0]);
	ll temp2=(ll)(Line[1][1]-Line[2][1])*(ll)(Line[1][0]-Line[0][0]);
	return temp1>=temp2;
}
int C;
int P;
void Stack_Push(int k) {
	++Stackp;
	Stack[0][Stackp]=(ll)S[k];
	Stack[1][Stackp]=-(ll)S[k]*(ll)S[k]+D[C%2][k];
	Stack[2][Stackp]=k;
}
void Stack_Pop() {
//	if(P==Stackp) P--;
	Stackp--;
}
void Stack_Clear() {
	Stackp=0;
}
void Graph(int k) {
	if(Stackp==0) {
		Stack_Push(k);
//		printf("<<<<<%d %lld %lld>>>>>\n", k, Stack[0][Stackp], Stack[1][Stackp]);
		return;
	}
	if(A[k]==0) return;
	if(Stackp==1) {
		Stack_Push(k);
//		printf("<<<<<%d %lld %lld>>>>>\n", k, Stack[0][Stackp], Stack[1][Stackp]);
		return;
	}

	Stack_Push(k);

//		printf("<<<<<%d %lld %lld>>>>>\n", k, Stack[0][Stackp], Stack[1][Stackp]);
//	printf(".%lld\t %lld\t %lld\n", Stack[0][Stackp-2], Stack[0][Stackp-1], Stack[0][Stackp]);
//	printf(".%lld\t %lld\t %lld\n", Stack[1][Stackp-2], Stack[1][Stackp-1], Stack[1][Stackp]);
	while(MyOperator(Stack[0]+Stackp-2, Stack[1]+Stackp-2)) {
		Stack_Pop();
		Stack_Pop();
		Stack_Push(k);
		if(Stackp<=2) break;
	}
}

ll MAX(ll x, ll y) {
	if(x>y) return x;
	else return y;
}
void Find(int i, int j);
void PROCESS() {
//	Trick();
	for(int i=1; i<=K; i++) {
		for(int j=i+1; j<=N; j++) D[i%2][j]=0;
		C=i-1;
		Stack_Clear();
		P=1;
		for(int j=i+1; j<=N; j++) {

			Graph(j-1);
			while(1) {
				if(P>=Stackp) break;
				ll nowa =Stack[0][P]	, nowb =Stack[1][P];
				ll nexta=Stack[0][P+1]	, nextb=Stack[1][P+1];

				ll nowD=nowa*(ll)S[j]+nowb, nextD=nexta*(ll)S[j]+nextb;
//				printf("<%d (%lld %lld) %lld (%lld %lld) %lld : %d>\n"
//						, k, nowa, nowb, nowD, nexta, nextb, nextD, S[j]);
				if(nowD<=nextD) P++;
				else break;
			}
			if(P>=Stackp) P=Stackp;


			ll Da =Stack[0][P]	, Db =Stack[1][P];
			D[i%2][j]=Da*(ll)S[j]+Db;
			Mom[i][j]=Stack[2][P];

//			printf("%d %d : %lld %lld / %lld (%d %d / %d)\n"
//					, i, j, Da, Db, D[i%2][j], k, Stackp, Stack[2][k]);


/*
			for(int k=i; k<j; k++) {
				ll temp=D[1-i%2][k]-((ll)S[k]*(ll)S[k])+(ll)S[j]*(ll)S[k];
				D[i%2][j]=MAX(D[i%2][j], temp);
				if(D[i%2][j]==temp) Mom[i][j]=k;
			}
			printf("%d %d / %lld %d\n"
					, i, j, D[i%2][j], Mom[i][j]);
*/

		}
	}
	long long Ans=0;
	int p=N;
	Ans=MAX(Ans, D[K%2][N]);
	printf("%lld\n", Ans);
	Find(K, p);
}
void Find(int i, int j) {
	if(i==0) return;
	printf("%d ", Mom[i][j]);
	return Find(i-1, Mom[i][j]);
}
int main() {
	INPUT();
	PROCESS();
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 999919994 == 999919994

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1093956 == 1093956
2 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 302460000 == 302460000
3 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 122453454361 == 122453454361
4 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 93663683509 == 93663683509
5 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1005304678 == 1005304678
6 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 933702 == 933702
7 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 25082842857 == 25082842857
8 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 687136 == 687136
9 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 27295930079 == 27295930079
10 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 29000419931 == 29000419931

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 610590000 == 610590000
2 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 311760000 == 311760000
3 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013
4 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673
5 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1019625819 == 1019625819
6 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 107630884 == 107630884
7 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 475357671774 == 475357671774
8 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 193556962 == 193556962
9 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 482389919803 == 482389919803
10 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 490686959791 == 490686959791

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 21503404 == 21503404
2 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 140412195 == 140412195
3 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 49729674225461 == 49729674225461
4 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 37485571387523 == 37485571387523
5 Correct 4 ms 93500 KB Output is correct - contestant found the optimal answer: 679388326 == 679388326
6 Correct 4 ms 93500 KB Output is correct - contestant found the optimal answer: 4699030287 == 4699030287
7 Correct 4 ms 93500 KB Output is correct - contestant found the optimal answer: 12418819758185 == 12418819758185
8 Correct 4 ms 93500 KB Output is correct - contestant found the optimal answer: 31093317350 == 31093317350
9 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 12194625429236 == 12194625429236
10 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 12345131038664 == 12345131038664

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1818678304 == 1818678304
2 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 1326260195 == 1326260195
3 Correct 48 ms 93500 KB Output is correct - contestant found the optimal answer: 4973126687469639 == 4973126687469639
4 Correct 0 ms 93500 KB Output is correct - contestant found the optimal answer: 3748491676694116 == 3748491676694116
5 Correct 36 ms 93500 KB Output is correct - contestant found the optimal answer: 1085432199 == 1085432199
6 Correct 44 ms 93500 KB Output is correct - contestant found the optimal answer: 514790755404 == 514790755404
7 Correct 52 ms 93500 KB Output is correct - contestant found the optimal answer: 1256105310476641 == 1256105310476641
8 Correct 28 ms 93500 KB Output is correct - contestant found the optimal answer: 3099592898816 == 3099592898816
9 Correct 32 ms 93500 KB Output is correct - contestant found the optimal answer: 1241131419367412 == 1241131419367412
10 Correct 48 ms 93500 KB Output is correct - contestant found the optimal answer: 1243084101967798 == 1243084101967798

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 93500 KB Output is correct - contestant found the optimal answer: 19795776960 == 19795776960
2 Correct 16 ms 93500 KB Output is correct - contestant found the optimal answer: 19874432173 == 19874432173
3 Correct 492 ms 93500 KB Output is correct - contestant found the optimal answer: 497313449256899208 == 497313449256899208
4 Correct 16 ms 93500 KB Output is correct - contestant found the optimal answer: 374850090734572421 == 374850090734572421
5 Correct 668 ms 93500 KB Output is correct - contestant found the optimal answer: 36183271951 == 36183271951
6 Correct 460 ms 93500 KB Output is correct - contestant found the optimal answer: 51629847150471 == 51629847150471
7 Correct 528 ms 93500 KB Output is correct - contestant found the optimal answer: 124074747024496432 == 124074747024496432
8 Correct 372 ms 93500 KB Output is correct - contestant found the optimal answer: 309959349080800 == 309959349080800
9 Correct 376 ms 93500 KB Output is correct - contestant found the optimal answer: 124113525649823701 == 124113525649823701
10 Correct 456 ms 93500 KB Output is correct - contestant found the optimal answer: 124309619349406845 == 124309619349406845