Submission #408899

#	Time	Username	Problem	Language	Result	Execution time	Memory
408899		Blistering_Barnacles	Split the sequence (APIO14_sequence)	C++11	0 / 100	72 ms	131076 KiB

sequence

//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, dp[205][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
ll mem(ll i , ll k1){
    if(i > n)R 1 ;
    if(k < k1 || i == n)R 0 ;
    ll &r = dp[k1][i] ;
    if(r != -1)R r ;
    r = 0 ;
    for(ll j = i ; j <= n ; j++){
        r = max(r , mem(j + 1 , k1 + 1) + (b[j] - b[i - 1]) * (b[n] - b[j])) ;
    }
    R r ;
}
void get(ll i , ll k1){
    if(i > n)R ;
    ll op = 0 , o1 = 0 ;
    for(ll j = i ; j <= n ; j++){
        if(mem(j + 1 , k1 + 1) > op)op = mem(j + 1 , k1 + 1) , o1 = j ;
    }
    cout << o1 << " " ;
    //cout << (b[o1] - b[i - 1]) * (b[n] - b[o1]) << " " ;
    get(o1 + 1 , k1 + 1) ;
}
void solve(){
    msdp(dp) ;
    cin >> n >> k ;
    for(ll i = 1 ; i <= n ; i++){
        cin >> a[i] ;
        b[i] = b[i - 1] + a[i] ;
    }
    cout << mem(1 , 1) << endl ;
    get(1 , 1) ;
}
int main(){
    fast ;
    //cin >> q;
    q = 1;
    while(q--){
        solve();
    }
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29