Submission #1122884

#	Time	Username	Problem	Language	Result	Execution time	Memory
1122884		Ice_man	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	328 KiB

segments

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

*/

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

#define maxn 500005
#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;





ll pref[maxn];
int a[maxn] , n;
int endd[maxn];
ll dp[maxn];

void read()
{
    cin >> n;

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


    for(int i = 1; i <= n; i++)
    {
        dp[i] = dp[max(endd[i] , endd[i - 1])] + 1;
        int pos = lower_bound(pref + 1 , pref + 1 + n , -pref[max(endd[i] , endd[i - 1])] + 2 * pref[i]) - pref;

        endd[pos] = i;
    }

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











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

    read();


    return 0;
}

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