Submission #334167

#	Time	Username	Problem	Language	Result	Execution time	Memory
334167		Kerim	Bigger segments (IZhO19_segments)	C++17	100 / 100	129 ms	16072 KiB

segments

#include "bits/stdc++.h"
#define MAXN 500009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
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;}
int dp[MAXN],n,x,tmp;
ll par[MAXN];
int main(){
  // freopen("file.in", "r", stdin);
    priority_queue<pair<ll,int> >q;
    q.push(mp(0,0));
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
		scanf("%d",&x);
		par[i]=par[i-1]+x;
		while(!q.empty() and par[i]>=-q.top().ff){
			if(dp[q.top().ss]>dp[tmp])
				tmp=q.top().ss;
			else if(dp[q.top().ss]==dp[tmp])
				umax(tmp,q.top().ss);
			q.pop();	
		}
		dp[i]=dp[tmp]+1;
		q.push(mp(par[tmp]-2*par[i],i));	
    }
    printf("%d\n",dp[n]);
	return 0;
}

Compilation message (stderr)

segments.cpp: In function 'int main()':
segments.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
segments.cpp:28:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   28 |   scanf("%d",&x);
      |   ~~~~~^~~~~~~~~

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