Submission #957751

#	Time	Username	Problem	Language	Result	Execution time	Memory
957751		I_am_Polish_Girl	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	348 KiB

segments

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <chrono>

using namespace std;

#define int long long

int log_ = 10;
int inf = 1000000000000000000;
int mod = 998244353;




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

    int n;
    cin >> n;

    vector <int> a(n);

    vector <int> pref;

    int pr = 0;


    pref.push_back(0);

    for (int i = 0; i < n; i++)
    {
        cin >> a[i];

        pr += a[i];
        pref.push_back(pr);
    }

    int ans = 0;
    for (int j = 1; j <= n; j++)
    {

        int l = 0;
        int r = pref[j];

        int col = 1;

        while (true)
        {
            int x = r + r - l;

            if (x > pref[pref.size() - 1])
            {
                break;
            }

            col++;

            int ind = lower_bound(pref.begin(), pref.end(), x) - pref.begin();

            l = r;
            r = pref[ind];
        }

        ans = max(ans, col);
    }


    cout << ans;
}

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