# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
241053 | 2020-06-22T11:59:26 Z | Nicholas_Patrick | 수열 (APIO14_sequence) | C++17 | 1630 ms | 81776 KB |
#include <cstdio> #include <queue> #include <algorithm> using namespace std; int n, k; vector <long long> a; vector <long long> memo1, memo2; vector <vector <int> > opt; int i; void solven(int l=1, int r=n, int ll=1, int rr=n){//[], [] if(l>r) return; long long best=-1; int mid=(l+r)/2; long long&ret=memo2[mid]; int&optt=opt[i][mid]; optt=-1; ret=-1ll; for(int i = ll;i <= min(mid, rr);i ++){ if(ret<(a[mid]-a[i])*(a[i]-a[0])+memo1[i]){ optt=i; ret=(a[mid]-a[i])*(a[i]-a[0])+memo1[i]; } } solven(l, mid-1, ll, optt); solven(mid+1, r, optt, rr); } long long solvenk(){ opt.resize(k+1, vector <int> (n+1)); memo1.assign(n+1, 0); memo2.assign(n+1, 0); for(i = 1;i <= k;i ++){ solven(); swap(memo1, memo2); } return memo1[n]; } int main(){ scanf("%d%d", &n, &k); a.resize(n+1); a[0]=0ll; for(i = 1;i <= n;i ++){ scanf("%lld", &a[i]); a[i]+=a[i-1]; } printf("%lld\n", solvenk()); int j = n; vector <int> ans; for(i = k;i;i --){ ans.push_back(opt[i][j]); j=opt[i][j]; } sort(ans.begin(), ans.end()); for(int i = 1;i < k;i ++){ while(ans[i-1]>=ans[i]){ ans[i]++; } } for(int i = 0;i < k;i ++){ printf("%d%c", ans[i], i==k-1?'\n':' '); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 4 ms | 384 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 4 ms | 384 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 4 ms | 384 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 5 ms | 256 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 5 ms | 512 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 4 ms | 256 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Correct | 6 ms | 512 KB | contestant found the optimal answer: 107630884 == 107630884 |
7 | Correct | 5 ms | 512 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
8 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 193556962 == 193556962 |
9 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
10 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 11 ms | 1152 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 5 ms | 384 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 15 ms | 1152 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Correct | 13 ms | 1024 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
7 | Correct | 13 ms | 1152 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 | Correct | 10 ms | 1152 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
9 | Correct | 6 ms | 512 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 | Correct | 8 ms | 640 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 768 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 7 ms | 768 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Correct | 79 ms | 8568 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 | Correct | 7 ms | 768 KB | contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 | Correct | 89 ms | 5248 KB | contestant found the optimal answer: 1085432199 == 1085432199 |
6 | Correct | 87 ms | 6144 KB | contestant found the optimal answer: 514790755404 == 514790755404 |
7 | Correct | 77 ms | 6528 KB | contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 | Correct | 54 ms | 5376 KB | contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 | Correct | 78 ms | 6264 KB | contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 | Correct | 98 ms | 7680 KB | contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 38 ms | 4216 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 35 ms | 4216 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Correct | 838 ms | 81776 KB | contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 | Correct | 30 ms | 4216 KB | contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 | Correct | 1630 ms | 81776 KB | contestant found the optimal answer: 36183271951 == 36183271951 |
6 | Correct | 986 ms | 58228 KB | contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 | Correct | 843 ms | 62064 KB | contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 | Correct | 590 ms | 51056 KB | contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 | Correct | 845 ms | 58224 KB | contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 | Correct | 1061 ms | 73840 KB | contestant found the optimal answer: 124309619349406845 == 124309619349406845 |