Submission #1278493

#	Time	Username	Problem	Language	Result	Execution time	Memory
1278493		hoangtien69	Cigle (COI21_cigle)	C++20	100 / 100	204 ms	134548 KiB

cigle

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5005;

int n;
int a[MAXN];
int pf[MAXN][MAXN];
int dp[MAXN][MAXN];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (int i = 2; i <= n; i++)
    {
        int trai = i - 1;
        int peal1 = 0;
        int peal2 = 0;
        int dem = 0;
        for (int j = i; j <= n; j++)
        {
            dp[i][j] = max(dp[i][j - 1], pf[i - 1][trai] + dem);
            peal1 += a[j];
            while (trai > 1 and peal1 > peal2)
            {
                peal2 += a[trai];
                trai--;
            }
            if (peal2 == peal1)
            {
                dem++;
            }
        }
        for (int k = 1; k <= i; k++)
        {
            pf[i][k] = max(pf[i][k - 1], dp[k][i]);
        }
    }
    int res = 0;
    for (int i = 1; i <= n; i++)
    {
        res = max(res, dp[i][n]);
    }
    cout << res;
}

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