#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);
#define MAXN 1005
#define MAXK 205
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;
mt19937 g1(time(0));
int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}
ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}
int len,K,arr[MAXN],par[MAXN][MAXK];
ll dp[MAXN][MAXK],psa[MAXN];
int main(){
scanf("%d %d",&len,&K); K++;
for(int i=1; i<=len; i++){
scanf(" %d",&arr[i]);
psa[i] = psa[i-1]+arr[i];
}
memset(dp,-0x3f,sizeof dp);
dp[0][0] = dp[0][1] = 0;
for(int i=1; i<=len; i++){
dp[i][1] = 0;
for(int k=2; k<=min(i,K); k++){
for(int v=i-1; v>=0; v--){
ll cst = dp[v][k-1]+(psa[i]-psa[v])*psa[v];
if(cst > dp[i][k]){
dp[i][k] = cst;
par[i][k] = v;
}
}
}
}
printf("%lld\n",dp[len][K]);
vector<int> v;
int curr = len;
for(int i=K; i>=1; i--){
if(i < K) v.pb(curr);
curr = par[curr][i];
}
for(int i=(int)v.size()-1; i>=0; i--)
printf("%d ",v[i]);
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&len,&K); K++;
~~~~~^~~~~~~~~~~~~~~~~
sequence.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d",&arr[i]);
~~~~~^~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
3 ms |
1916 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
4 ms |
1912 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
4 ms |
1912 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
4 ms |
1912 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
3 ms |
1960 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
4 ms |
1904 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
4 ms |
1912 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
4 ms |
1912 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
2044 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
3 ms |
1912 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
3 ms |
2040 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
7 ms |
2040 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
3 ms |
2168 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
7 ms |
2168 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
7 ms |
2168 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
7 ms |
2040 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
4 ms |
2088 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
4 ms |
2168 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
5 ms |
2040 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
2808 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
7 ms |
2808 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
207 ms |
2680 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
6 ms |
2680 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
215 ms |
2780 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
182 ms |
2708 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
207 ms |
2784 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
201 ms |
2776 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
43 ms |
2812 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
84 ms |
2680 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
1912 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
1912 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |