# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
995000 | 2024-06-08T09:35:32 Z | Baytoro | 수열 (APIO14_sequence) | C++17 | 706 ms | 88668 KB |
#include <bits/stdc++.h> using namespace std; #define fr first #define sc second #define pb push_back //#define int long long #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() void fopn(string name){ freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout); } #define ll long long const int N=2e5+5; int n; struct line{ ll m, b; ll operator *(int x){ return m*x+b; } int operator ^(line x){ return ceil((b-x.b)/(x.m-m)); } }; struct CHT{ deque<ll> a, b; deque<int> c; void init() { a.clear(); b.clear(); c.clear(); } void push(ll n, ll m, int v) { while (a.size() > 1 && (b[b.size() - 2] - b.back()) * (n - a.back()) >= (b.back() - m) * (a.back() - a[a.size() - 2])) { a.pop_back(); b.pop_back(); c.pop_back(); } a.push_back(n); b.push_back(m); c.push_back(v); } pair<ll, int> query(ll x) { while (a.size() > 1 && (a[1] - a[0]) * x > (b[0] - b[1])) { a.pop_front(); b.pop_front(); c.pop_front(); } return make_pair(a[0] * x + b[0], c[0]); } }; vector<ll> dp_cur(N),dp_prev(N); int p[N][205]; void solve(){ int n,k;cin>>n>>k; vector<ll> a(n+1),pref(n+1); for(int i=0;i<n;i++){ cin>>a[i]; pref[i+1]=a[i]+pref[i]; } for(int i=0;i<n-1;i++){ dp_prev[i]=pref[i+1]*(pref[n]-pref[i+1]); p[i][1]=-1; } for(int j=2;j<=k;j++){ CHT cht; dp_cur[0]=0; for(int i=1;i<n-1;i++){ cht.push(pref[i],dp_prev[i-1],i); auto it=cht.query(pref[i+1]-pref[n]); dp_cur[i]=it.fr+pref[i+1]*pref[n]-pref[i+1]*pref[i+1]; p[i][j]=it.sc-1; } dp_prev=dp_cur; } ll ans=0,c=0; for(int i=0;i<n-1;i++){ if(ans<dp_prev[i]){ ans=dp_prev[i]; c=i; } } cout<<ans<<endl; for(int i=0;i<k;i++){ cout<<c+1<<' '; c=p[c][k-i]; } } signed main(){ //fopn("paint"); int t=1;//cin>>t; while(t--) solve(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 108 == 108 |
2 | Correct | 1 ms | 3420 KB | contestant found the optimal answer: 999 == 999 |
3 | Correct | 1 ms | 3416 KB | contestant found the optimal answer: 0 == 0 |
4 | Correct | 2 ms | 3492 KB | contestant found the optimal answer: 1542524 == 1542524 |
5 | Correct | 2 ms | 3468 KB | contestant found the optimal answer: 4500000000 == 4500000000 |
6 | Correct | 1 ms | 3420 KB | contestant found the optimal answer: 1 == 1 |
7 | Correct | 1 ms | 3420 KB | contestant found the optimal answer: 1 == 1 |
8 | Correct | 1 ms | 3416 KB | contestant found the optimal answer: 1 == 1 |
9 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 100400096 == 100400096 |
10 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 900320000 == 900320000 |
11 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 3698080248 == 3698080248 |
12 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 3200320000 == 3200320000 |
13 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 140072 == 140072 |
14 | Correct | 1 ms | 3420 KB | contestant found the optimal answer: 376041456 == 376041456 |
15 | Correct | 1 ms | 3420 KB | contestant found the optimal answer: 805 == 805 |
16 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 900189994 == 900189994 |
17 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 999919994 == 999919994 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 1093956 == 1093956 |
2 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 302460000 == 302460000 |
3 | Correct | 4 ms | 3624 KB | contestant found the optimal answer: 122453454361 == 122453454361 |
4 | Correct | 2 ms | 3416 KB | contestant found the optimal answer: 93663683509 == 93663683509 |
5 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 1005304678 == 1005304678 |
6 | Correct | 2 ms | 3600 KB | contestant found the optimal answer: 933702 == 933702 |
7 | Correct | 3 ms | 3420 KB | contestant found the optimal answer: 25082842857 == 25082842857 |
8 | Correct | 2 ms | 3416 KB | contestant found the optimal answer: 687136 == 687136 |
9 | Correct | 2 ms | 3416 KB | contestant found the optimal answer: 27295930079 == 27295930079 |
10 | Correct | 2 ms | 3420 KB | contestant found the optimal answer: 29000419931 == 29000419931 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 3672 KB | contestant found the optimal answer: 610590000 == 610590000 |
2 | Correct | 2 ms | 3676 KB | contestant found the optimal answer: 311760000 == 311760000 |
3 | Correct | 14 ms | 3748 KB | contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 | Correct | 2 ms | 3504 KB | contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 | Correct | 12 ms | 3676 KB | contestant found the optimal answer: 1019625819 == 1019625819 |
6 | Correct | 13 ms | 3752 KB | contestant found the optimal answer: 107630884 == 107630884 |
7 | Correct | 14 ms | 3676 KB | contestant found the optimal answer: 475357671774 == 475357671774 |
8 | Correct | 4 ms | 3676 KB | contestant found the optimal answer: 193556962 == 193556962 |
9 | Correct | 4 ms | 3676 KB | contestant found the optimal answer: 482389919803 == 482389919803 |
10 | Correct | 5 ms | 3688 KB | contestant found the optimal answer: 490686959791 == 490686959791 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 5724 KB | contestant found the optimal answer: 21503404 == 21503404 |
2 | Correct | 2 ms | 5724 KB | contestant found the optimal answer: 140412195 == 140412195 |
3 | Correct | 19 ms | 5724 KB | contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 | Correct | 2 ms | 5724 KB | contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 | Correct | 22 ms | 5836 KB | contestant found the optimal answer: 679388326 == 679388326 |
6 | Correct | 16 ms | 5724 KB | contestant found the optimal answer: 4699030287 == 4699030287 |
7 | Correct | 20 ms | 5832 KB | contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 | Correct | 18 ms | 5724 KB | contestant found the optimal answer: 31093317350 == 31093317350 |
9 | Correct | 5 ms | 5724 KB | contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 | Correct | 8 ms | 5724 KB | contestant found the optimal answer: 12345131038664 == 12345131038664 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 12124 KB | contestant found the optimal answer: 1818678304 == 1818678304 |
2 | Correct | 4 ms | 12124 KB | contestant found the optimal answer: 1326260195 == 1326260195 |
3 | Correct | 72 ms | 12124 KB | contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 | Correct | 7 ms | 12124 KB | contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 | Correct | 53 ms | 12120 KB | contestant found the optimal answer: 1085432199 == 1085432199 |
6 | Correct | 53 ms | 12124 KB | contestant found the optimal answer: 514790755404 == 514790755404 |
7 | Correct | 57 ms | 12204 KB | contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 | Correct | 46 ms | 12124 KB | contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 | Correct | 66 ms | 12120 KB | contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 | Correct | 63 ms | 12124 KB | contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 88144 KB | contestant found the optimal answer: 19795776960 == 19795776960 |
2 | Correct | 30 ms | 88388 KB | contestant found the optimal answer: 19874432173 == 19874432173 |
3 | Correct | 529 ms | 88656 KB | contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 | Correct | 33 ms | 88656 KB | contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 | Correct | 706 ms | 88400 KB | contestant found the optimal answer: 36183271951 == 36183271951 |
6 | Correct | 465 ms | 88144 KB | contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 | Correct | 496 ms | 88664 KB | contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 | Correct | 395 ms | 88652 KB | contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 | Correct | 414 ms | 88668 KB | contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 | Correct | 524 ms | 88660 KB | contestant found the optimal answer: 124309619349406845 == 124309619349406845 |