제출 #201377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201377		guangxuan	Bigger segments (IZhO19_segments)	C++14	13 / 100	6 ms	760 KiB

segments

#include <bits/stdc++.h>

using namespace std;

int a[500009];
long long rs[500009];
pair<int,int> dp[500009];

struct node{
	pair<int,int> v;
	node *l,*r;
	node():v({-1,0}),l(NULL),r(NULL){}
	void up(long long s,long long e,long long x,pair<int,int> uv){
		long long m = (s+e)/2;
		if(s==e){
			v = max(v,uv);return;
		}
		if(x>m){
			if(r==NULL)r = new node();
			r->up(m+1,e,x,uv);
		}
		else{
			if(l==NULL)l = new node();
			l->up(s,m,x,uv);
		}
		v = {-1,0};
		if(r)v = max(v,r->v);
		if(l)v = max(v,l->v);
	}
	pair<int,int> qu(long long s,long long e,long long x,long long y){
		long long m = (s+e)/2;
		if(s==x&&e==y)return v;
		if(x>m){
			if(r)return r->qu(m+1,e,x,y);
			else return {-1,0};
		}
		if(y<=m){
			if(l)return l->qu(s,m,x,y);
			else return {-1,0};
		}
		pair<int,int> qv = {-1,0};
		if(r)qv = max(qv,r->qu(m+1,e,m+1,y));
		if(l)qv = max(qv,l->qu(s,m,x,m));
		return qv;
	}
}*root;

int main(){
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
		rs[i+1]=rs[i]+a[i];
	}
	root = new node();
	root->up(0,(long long)5e14,0,{0,0});
	for(int i=1;i<=n;i++){
		pair<int,int> res = root->qu(0,(long long)5e14,0,rs[i]); 
		dp[i] = {res.first,rs[res.second] - rs[i]};
		dp[i].first++;
		root->up(0,(long long)5e14,rs[i] - dp[i].second,{dp[i].first,i});
		//cout << dp[i].first << ' ' << dp[i].second << '\n';
		// cout << res.first << ' ' << res.second.first << ' ' << res.second.second << '\n';
	}
	printf("%d", dp[n].first);
}

컴파일 시 표준 에러 (stderr) 메시지

segments.cpp: In function 'int main()':
segments.cpp:50:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
segments.cpp:52:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&a[i]);
   ~~~~~^~~~~~~~~~~~

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