# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
31043 | 2017-08-06T02:00:54 Z | 14kg | 수열 (APIO14_sequence) | C++11 | 1279 ms | 87844 KB |
#include <stdio.h> #define N 100010 #define INF 999999999999999999 struct Line { long long m, b; int path; } stack[N]; int n, m, sw, stack_len, path[210][N]; long long d[2][N], s[N]; long double cross(Line x, Line y) { if (x.m == y.m) return -INF; return (y.b - x.b) / (x.m - y.m); } void push(Line line) { if (line.m == 0) stack_len = 0, sw = 1; while (stack_len > sw && cross(stack[stack_len - 1], stack[stack_len]) > cross(stack[stack_len], line)) stack_len--; stack[++stack_len] = line; } long long get(long long x) { while (sw < stack_len && stack[sw].m*x + stack[sw].b <= stack[sw + 1].m*x + stack[sw + 1].b) sw++; return stack[sw].m*x + stack[sw].b; } int main() { int x; scanf("%d %d", &n, &m), m++; for (int i = 1; i <= n; i++) scanf("%d", &x), s[i] = s[i - 1] + (long long)x; for (int i = 1; i <= n; i++) d[1][i] = 0; for (int i = 2; i <= m; i++) { stack[sw = stack_len = 1] = { 0,-INF }; for (int j = i - 1; j <= n; j++) { d[i % 2][j] = get(s[j]), path[i][j] = stack[sw].path; push({ s[j], d[(i + 1) % 2][j] - s[j] * s[j], j }); } } printf("%lld\n", d[m % 2][n]); for (int i = m, k = path[m][n]; i >= 2; k = path[--i][k]) printf("%d ", k); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 107630884 == 107630884 |
7 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
8 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 193556962 == 193556962 |
9 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
10 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 9 ms | 87844 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 9 ms | 87844 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Correct | 6 ms | 87844 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
7 | Correct | 13 ms | 87844 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 | Correct | 6 ms | 87844 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
9 | Correct | 0 ms | 87844 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 | Correct | 3 ms | 87844 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 87844 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 3 ms | 87844 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Correct | 93 ms | 87844 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 | Correct | 3 ms | 87844 KB | contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 | Correct | 76 ms | 87844 KB | contestant found the optimal answer: 1085432199 == 1085432199 |
6 | Correct | 83 ms | 87844 KB | contestant found the optimal answer: 514790755404 == 514790755404 |
7 | Correct | 103 ms | 87844 KB | contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 | Correct | 63 ms | 87844 KB | contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 | Correct | 73 ms | 87844 KB | contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 | Correct | 99 ms | 87844 KB | contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 87844 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 36 ms | 87844 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Correct | 926 ms | 87844 KB | contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 | Correct | 29 ms | 87844 KB | contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 | Correct | 1279 ms | 87844 KB | contestant found the optimal answer: 36183271951 == 36183271951 |
6 | Correct | 919 ms | 87844 KB | contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 | Correct | 859 ms | 87844 KB | contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 | Correct | 736 ms | 87844 KB | contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 | Correct | 849 ms | 87844 KB | contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 | Correct | 879 ms | 87844 KB | contestant found the optimal answer: 124309619349406845 == 124309619349406845 |