NKSEQ - Dãy số
Tác giả: hieult
Ngôn ngữ: C++
#include <stdio.h>
//#include <conio.h>
int min(int x,int y)
{
if(x<y)
return x;
return y;
}
main()
{
int n,a[100001],A[100001],B[100002],l[100001],r[100001],KQ=0;
scanf("%d",&n);
A[0]=0;B[n+1]=0;
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
A[i]=A[i-1]+a[i];
}
l[1]=a[1],r[n]=a[n];l[0]=0;
for(int i=n;i>=1;i--)
B[i]=B[i+1]+a[i];
for(int i=2;i<=n;i++)
l[i]=min(l[i-1],A[i]);
for(int i=n-1;i>=1;i--)
r[i]=min(r[i+1]+a[i],a[i]);
for(int i=1;i<=n;i++)
{
if(r[i]>0&&B[i]+l[i-1]>0)
KQ++;
}
printf("%d",KQ);
//getch();
}