Submission #503131

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
503131	2022-01-07T10:44:22 Z	Khizri	Split the sequence (APIO14_sequence)	C++17	0 / 100	2000 ms	13204 KB

sequence

#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);
    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
int t=1,n,k,arr[mxn],sum[mxn],idx[mxn],dp[mxn][205];
int funk(int ind,int k){
    if(k==0) return 0;
    if(dp[ind][k]!=0){
        return dp[ind][k];
    }
    int ans=0;
    for(int i=ind;i<=n-k+1;i++){
        int x=(sum[i]-sum[ind-1])*(sum[n]-sum[i])+funk(i+1,k-1);
        if(x>ans){
            ans=x;
            if(k-1>0){
                idx[ind]=i+1;
            }
        }
    }
    return dp[ind][k]=ans;
}
void solve(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
        sum[i]=sum[i-1]+arr[i];
    }
    cout<<funk(1,k)<<endl;
    int x=1;
    while(x!=0&&k){
        k--;
        x=idx[x];
        cout<<x-1<<' ';
    }
}
int main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
0 / 11.0

#	Verdict	Memory	Grader output
1	Correct	336 KB	contestant found the optimal answer: 108 == 108
2	Incorrect	332 KB	Integer -1 violates the range [1, 9]
3	Halted	0 KB	-

Subtask #2
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	316 KB	declared answer doesn't correspond to the split scheme: declared = 1093956, real = 914316
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	440 KB	contestant found the optimal answer: 610590000 == 610590000
2	Correct	1 ms	448 KB	contestant found the optimal answer: 311760000 == 311760000
3	Incorrect	1 ms	460 KB	Integer -1 violates the range [1, 199]
4	Halted	0 ms	0 KB	-