oj.uz

답안 #7662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
7662 2014-08-13T11:44:27 Z imsifile 수열 (APIO14_sequence) C++
0 / 100
 0 ms 84764 KB 
#include<stdio.h>
#define sq(a) ((a)*(a))
#define sik(l,x) (-(l.a)*(x)+(l.b))

typedef long long lld;

struct lin {
	int ix;
	lld a, b; // -ax+b
}stk[100100], im;

int n, k, di[100100][202], scn;
lld ba[100100], dy[100100][2];

int main(){
	int i, i2, j, t=1;
	scanf("%d%d", &n, &k);
	for(i=1; i<=n; i++){
		scanf("%lld", &ba[i]), ba[i]+=ba[i-1];
		dy[i][0]=sq(ba[i]);
	}
	for(j=1; j<=k; j++){
		im.a=2*ba[j], im.b=dy[j][1-t]+sq(ba[j]), im.ix=j;
		stk[0]=im, scn=1;
		for(i=1; i<=j; i++)dy[i][t]=0;
		for(i=j+1, i2=0; i<=n; i++){
			for(; i2<scn-1; i2++){
				if(sik(stk[i2],ba[i])<sik(stk[i2+1],ba[i]))break;
			}
			di[i][j]=stk[i2].ix, dy[i][t]=sq(ba[i])+sik(stk[i2],ba[i]);
			im.ix=i, im.a=2*ba[i], im.b=dy[i][1-t]+sq(ba[i]);
			for(; scn>=2; scn--){
				if((stk[scn-1].b-stk[scn-2].b)*(im.a-stk[scn-2].a)<(im.b-stk[scn-2].b)*(stk[scn-1].a-stk[scn-2].a))break;
			}
			stk[scn++]=im;
			if(i2>=scn)i2=scn-1;
		}
		t=1-t;
	}
	printf("%lld\n", (sq(ba[n])-dy[n][1-t])/2);
	for(i=n, j=k; j>0; j--)printf("%d ", di[i][j]), i=di[i][j];
	return 0;
}

Subtask #1
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 108 == 108
2 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 999 == 999
3 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 0 == 0
4 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 1542524 == 1542524
5 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 4500000000 == 4500000000
6 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 1 == 1
7 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 1 == 1
8 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 1 == 1
9 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 100400096 == 100400096
10 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 900320000 == 900320000
11 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 3698080248 == 3698080248
12 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 3200320000 == 3200320000
13 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 140072 == 140072
14 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 376041456 == 376041456
15 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 805 == 805
16 Correct 0 ms 84764 KB Output is correct - contestant found the optimal answer: 900189994 == 900189994
17 Incorrect 0 ms 84764 KB Output isn't correct - contestant didn't find the optimal answer: 999919991 < 999919994

Subtask #2
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #3
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #4
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #5
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -