#include<bits/stdc++.h>
using namespace std ;
#define ll long long
#define ld double
#define maxn 200009
#define fi first
#define se second
#define pb push_back
#define left id<<1
#define right id<<1|1
#define re exit(0);
#define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
const int mod = 1e9+7 ;
const int INF = 1e9 ;
const int LOG = 18 ;
typedef vector<int> vi ;
typedef pair<int,int> pii ;
typedef vector<ll> vl ;
typedef vector<pii> vii ;
void add ( int &a , int b )
{
a += b ;
if ( a < 0 ) a += mod ;
if ( a >= mod ) a -= mod ;
}
template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ; }
template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ; }
void rf ()
{
freopen ("bai1.inp","r",stdin) ;
// freopen ("bai1.out","w",stdout) ;
}
int _pow ( int a , int n )
{
if ( n == 0 ) return 1 ;
int res = _pow (a,n/2) ;
if ( n % 2 ) return 1ll*res*res%mod*a%mod ;
else return 1ll*res*res%mod ;
}
int n , k ;
int a [maxn] , sum [maxn] ;
ll dp [maxn] ;
int trace [maxn][209] ;
struct line {
int a ; ll b ;
int id ;
line ( int _a , ll _b , int _id ) {
a = _a , b = _b , id = _id ;
}
ll eval ( int x ) {
return 1ll*x*a+b ;
}
};
struct CHT {
vector <line> T ;
bool badline ( line A , line B , line C )
{
return (ld)(C.b-A.b)/(A.a-C.a) <= (ld)(B.b-A.b)/(A.a-B.a) ;
}
void ins ( line m )
{
while (T.size()>=2)
{
if ( badline(T[T.size()-2],T.back(),m)) T.pop_back() ;
else break ;
}
T.pb(m) ;
}
pair<ll,ll> get ( int x )
{
int l = 0 , r =T.size()-2 ;
while ( l <= r )
{
int mid = (l+r)/2 ;
if ( T[mid].eval(x) <= T[mid+1].eval(x) ) l = mid + 1 ;
else r = mid - 1 ;
}
return {T[l].eval(x),T[l].id} ;
}
void clear ()
{
T . clear () ;
}
};
int main ()
{
ios_base::sync_with_stdio(0);
cin.tie(0);cout.tie(0) ;
// rf () ;
cin >> n >> k ;
for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] , sum [i] = sum [i-1] + a [i] ;
k ++ ;
memset ( dp , 0x3f , sizeof dp ) ;
CHT T ;
for ( int r = 1 ; r <= k ; r ++ )
{
T.clear() ;
T.ins({0,0,0}) ;
for ( int i = 1 ; i <= n ; i ++ )
{
int C = sum [n] - sum [i] ;
auto F = T.get (-C) ;
if ( dp[i] < 1e18 ) T.ins({sum[i],dp[i],i}) ;
dp [i] = F.fi + 1ll*C*sum[i] ;
trace [i][r] = F.se ;
}
}
cout << dp [n] << "\n" ;
vi res ;
int pos = n ;
while ( k > 1 )
{
pos = trace [pos][k] ;
res . pb (pos) ;
k -- ;
}
reverse(res.begin(),res.end()) ;
for ( auto x : res ) cout << x << " " ;
}
// range , error , check speical , ...
// find key , find key
//'-std=c++11' stay hard
// there is no tomorrow
Compilation message
sequence.cpp: In function 'void rf()':
sequence.cpp:35:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | freopen ("bai1.inp","r",stdin) ;
| ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4560 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4596 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4596 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4564 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
4696 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
4748 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
4700 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
4744 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
4700 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
6748 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
6748 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
9 ms |
6856 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
6612 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
6748 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
9 ms |
6984 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
6744 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
8 ms |
6748 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
6748 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
6748 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
13144 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
13144 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
88 ms |
13516 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
4 ms |
13588 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
64 ms |
13148 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
82 ms |
13144 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
79 ms |
13340 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
68 ms |
13500 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
68 ms |
13336 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
86 ms |
13340 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
32 ms |
91180 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
33 ms |
91344 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
1038 ms |
91172 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
31 ms |
90320 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1227 ms |
91164 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
967 ms |
90056 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
918 ms |
91344 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
812 ms |
91344 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
785 ms |
91600 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
1004 ms |
90316 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
