Submission #1122868

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122868		Ice_man	Bigger segments (IZhO19_segments)	C++17	37 / 100	109 ms	2984 KiB

segments

/**
 ____    ____    ____    __________________    ____    ____    ____
||I ||  ||c ||  ||e ||  ||                ||  ||M ||  ||a ||  ||n ||
||__||  ||__||  ||__||  ||________________||  ||__||  ||__||  ||__||
|/__\|  |/__\|  |/__\|  |/________________\|  |/__\|  |/__\|  |/__\|

*/

#include <iostream>
#include <chrono>
#include <vector>
#include <algorithm>

#define maxn 100005
#define maxlog 20
#define INF 1000000010
#define LINF 1000000000000000005
#define endl '\n'
#define pb(x) push_back(x)
#define X first
#define Y second
#define control cout<<"passed"<<endl;

using namespace std;


typedef pair <int, int> pii;
typedef long long ll;
typedef pair <ll , ll> pll;
typedef pair <int , ll> pil;
typedef pair <ll , int> pli;
typedef long double ld;




int n;
int a[maxn];
pll dp[maxn];
ll pref[maxn];

void read()
{
    cin >> n;

    for(int i = 1; i <= n; i++)
        cin >> a[i];
    dp[1] = {1 , a[1]};

    pref[0] = 0;
    for(int i = 1; i <= n; i++)
        pref[i] = pref[i - 1] + a[i];

    for(int i = 2; i <= n; i++)
    {
        dp[i] = {dp[i - 1].X , dp[i - 1].Y + a[i]};

        for(int j = i - 1; j >= max(1 , i - 2000); j--)
            if(pref[i] - pref[j] >= dp[j].Y)
            {
                /**if(i == 4 && j == 2)
                    cout << dp[i].X << " " << dp[i].Y << " " << dp[j].X << " " << dp[j].Y << endl;

                if(i == 4 && j == 1)
                    cout << dp[i].X << " " << dp[i].Y << " " << dp[j].X << " " << dp[j].Y << endl;*/

                if(dp[j].X + 1 > dp[i].X)
                    dp[i] = {dp[j].X  + 1 , pref[i] - pref[j]}/** , cout << 0 << endl*/;

                if(dp[j].X + 1 == dp[i].X && dp[i].Y > pref[i] - pref[j])
                    dp[i] = {dp[j].X  + 1 , pref[i] - pref[j]}/** , cout << 1 << endl;*/;

                /**if(i == 4 && j == 2)
                    cout << dp[i].X << " " << dp[i].Y << " " << dp[j].X << " " << dp[j].Y << endl;

                if(i == 4 && j == 1)
                    cout << dp[i].X << " " << dp[i].Y << " " << dp[j].X << " " << dp[j].Y << endl;*/

                //break;
            }
    }


    //for(int i = 1; i <= n; i++)
      //  cout << dp[i].X << " " << dp[i].Y << endl;


    cout << dp[n].X << endl;
}











int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    read();


    return 0;
}

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