제출 #254190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
254190		_ypc	Bigger segments (IZhO19_segments)	C++98	73 / 100	29 ms	10488 KiB

segments

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=2e5+5;
LL n,a[maxn],f[maxn],sum[maxn],ans;
inline LL rad(){
	int ret=0,flg=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-')flg=-1;ch=getchar();}
	while (isdigit(ch))ret=ret*10+ch-'0',ch=getchar();
	return ret*flg;
}
int main(){
//	freopen("bigger.in","r",stdin);
//	freopen("bigger.out","w",stdout);
    n=rad();
    for (int i=1;i<=n;i++)sum[i]=sum[i-1]+rad();
    for (int i=1;i<=n;i++){
    	f[i]=max(f[i],f[i-1]);
    	LL tmp=sum[i]-sum[f[i]];
    	int lp=lower_bound(sum+1,sum+1+n,sum[i]+tmp)-sum;
    	f[lp]=i;
	}
	for (int i=n;i;i=f[i])ans++;
	printf("%lld\n",ans);
	return 0;
}

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