Submission #535825

#	Time	Username	Problem	Language	Result	Execution time	Memory
535825		Blistering_Barnacles	Cigle (COI21_cigle)	C++17	48 / 100	1085 ms	15364 KiB

cigle

//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
//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::sync_with_stdio(0) , cin.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[505][505], a[555555] , pref[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void solve(){
    cin >> n ;
    for(ll i = 1 ;i <= n ; i++){
        cin >> a[i] ;
        pref[i] = pref[i - 1] + a[i] ;
    }
    ll ans = 0 ;
    for(ll i = 2 ; i <= n ; i++){
        for(ll j = i ; j <= n ; j++){
            ll sum = 0 , j1 = i ;
            dp[i][j] = dp[i - 1][i - 1] ;
            for(ll i1 = i - 2 ; i1 >= 1 ; i1--){
                if(i == j){
                    dp[i][i] = max(dp[i][i] , dp[i1][i - 1]) ;
                    C ;
                }
                while(pref[j1] < 2 * pref[i - 1] - pref[i1] && j1 + 1 < j)j1++ ;
                sum += (pref[j1] == 2 * pref[i - 1] - pref[i1]) ;
                dp[i][j] = max(dp[i][j] , dp[i1][i - 1] + sum) ;
            }
            ans = max(ans , dp[i][j]) ;
        }
    }
    cout << ans << endl ;
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

• Subtask 1: 9 / 9
• Subtask 2: 11 / 11
• Subtask 3: 13 / 13
• Subtask 4: 15 / 15
• Subtask 5: 0 / 52