제출 #1212001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212001		naelwb	Cigle (COI21_cigle)	C++20	48 / 100	1098 ms	196424 KiB

cigle

#include <bits/stdc++.h>
using namespace std;
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#define fi first
#define se second
#define pb push_back
#define int long long
#define mp make_pair
#define pii pair<int, int>
typedef long long ll;
const int INF = 1e13;
const int mxn = 2e5+5;
const int mod = 1e9+7;
inline int mul(int a, int b){return (a*b)%mod;}

void solve(){
    int n; cin >> n;
    int a[n+1];
    vector<vector<int>> dp(n+2, vector<int>(n+2, 0LL));
    for(int i = 1; i <= n; i++)cin>>a[i];
   
    for(int j = 1; j <= n; j++){
        for(int i = 1; i <= j; i++){
            vector<int> pref(n+1, 0);
            pref[0] = 0;
            int cur = 0, id = i, val = 0;
            for(int k = i-1; k >= 1; k--){
                pref[i-k] += pref[i-k-1] + a[k];
                
                while(pref[i-k-1] > cur && id<=j){
                    cur += a[id];
                    ++id;
                }
                if(pref[i-k-1]==cur && id<=j && id>=i+1 && i>=3){
                    val++;
                }
                dp[i][j] = max(dp[i][j], dp[k][i-1] + val);
            }
        }
    }
    int ans = 0; 
    for(int i = 1; i <= n; i++){
        ans = max(ans, *(max_element(dp[i].begin(), dp[i].end())));
    }
    cout << ans << endl;

}


int32_t main(){
    fastio;
    int t = 1; 
    // cin>>t;
    while(t--){
        solve();
    }
}

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