Submission #1133518

#	Time	Username	Problem	Language	Result	Execution time	Memory
1133518		KasymK	Bigger segments (IZhO19_segments)	C++17	0 / 100	3 ms	8264 KiB

segments

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<=b){a=b;return 1;}return 0;}
const int N = 5e5+5;
int v[N], ans[N];
ll par[N];

struct node {
    int in, val;
    ll sm;
    node(){
        sm=0, in=0, val=0;
    };
} dp[N];

int main(){
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d", v+i), par[i]=par[i-1]+v[i];
    vector<ll> A;
    for(int i = 0; i <= n; ++i)
        A.pb(par[i]);
    // tr(it, A)
    // printf("%lld ", *it);
    // puts("");wr;
    for(int i = 1; i <= n; ++i)
        dp[i].sm=par[i], dp[i].in=0, dp[i].val=1;
    for(int i = 1; i <= n; ++i){
        int l=lower_bound(all(A), 2*par[i]-par[dp[i].in])-A.begin();
        if(umax(dp[l].val, dp[i].val+1))
            dp[l].sm=par[l]-par[i], dp[l].in=i;
    }
    int answer=0;
    for(int i = 1; i <= n; ++i)
        umax(answer, dp[i].val);
    printf("%d\n", answer);
    return 0;
}

Compilation message (stderr)

segments.cpp: In function 'int main()':
segments.cpp:29:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
segments.cpp:31:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |         scanf("%d", v+i), par[i]=par[i-1]+v[i];
      |         ~~~~~^~~~~~~~~~~

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