제출 #1172030

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1172030		AtabayRajabli	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	320 KiB

segments

#include <bits/stdc++.h>
#define int long long
#define all(v) v.begin(), v.end()
using namespace std;

const int sz = 3e3 + 1, inf = 1e18;
int n, a[sz], dp[sz][sz];

signed main()
{                                                                  
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    int ans = 0;
    for(int bt = 0; bt < (1 << n); bt++)
    {
        cout << bt << " : ";
        int prv = 0, cnt = 0;
        for(int i = 0; i < n && cnt >= 0; i++)
        {
            int x = ((1 << i) & bt);
            int j = i + 1, sm = a[i];
            while(j < n && !!((1 << j) & bt) == x)
            {
                sm += a[j];
                j++;
            }
            if(sm >= prv)
            {
                prv = sm;
                cnt++;
            }
            else cnt = -1;
            i = j - 1;
        }
        cout << cnt << endl;
        ans = max(ans, cnt);
    }
    // 10011
    // 16 + 2 + 1
    cout << ans;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27