BZOJ2274: [Usaco2011 Feb]Generic Cow Protests

2274: [Usaco2011 Feb]Generic Cow Protests

Time Limit: 10 Sec  Memory Limit: 128 MB
Submit: 196  Solved: 122
[Submit][Status]

Description

Farmer John's N (1 <= N <= 100,000) cows are lined up in a row and
numbered 1..N. The cows are conducting another one of their strange
protests, so each cow i is holding up a sign with an integer A_i
(-10,000 <= A_i <= 10,000).

FJ knows the mob of cows will behave if they are properly grouped
and thus would like to arrange the cows into one or more contiguous
groups so that every cow is in exactly one group and that every
group has a nonnegative sum.

Help him count the number of ways he can do this, modulo 1,000,000,009.

By way of example, if N = 4 and the cows' signs are 2, 3, -3, and
1, then the following are the only four valid ways of arranging the
cows:

(2 3 -3 1)
(2 3 -3) (1)
(2) (3 -3 1)
(2) (3 -3) (1)

Note that this example demonstrates the rule for counting different
orders of the arrangements.

给出n个数，问有几种划分方案（不能改变数的位置），使得每组中数的和大于等于0。输出方案数除以 1000000009的余数。

Input

* Line 1: A single integer: N

* Lines 2..N + 1: Line i + 1 contains a single integer: A_i

Output

* Line 1: A single integer, the number of arrangements modulo
        1,000,000,009.

Sample Input

4
2
3
-3
1

Sample Output

4

HINT

Source

Gold

题解：

比较好的一道题。

刚开始看了没思路，后来想了想发现i+1 到 j 可以分一段等价与 s[i]>=s[j]

然后设 f[i]表示前 i 个数能分成的方案数，然后那么 f[i]=sigma(f[j]) s[i]>=s[j]  初值f[0]=1

然后我们发现这样暴力做的话是n^2的，那么考虑优化

既然 s[i]>=s[j] 时 f[j]才可以更新 f[i]，那我们换一个思路来考虑,另 g[i] 表示前缀和第 i 大的前缀可以划分的方案总数

那么 f[i]=sigma(g[j])  1<=j<=s[i] 然后还要给 g[s[i]]+=f[i]

想到了什么？对了，就是树状数组。

离散化一下，然后注意一下边界就可以过了。

status没rank1表示很桑心

代码：

 #include<cstdio>

 #include<cstdlib>

 #include<cmath>

 #include<cstring>

 #include<algorithm>

 #include<iostream>

 #include<vector>

 #include<map>

 #include<set>

 #include<queue>

 #include<string>

 #define inf 1000000000

 #define maxn 150000

 #define maxm 500+100

 #define eps 1e-10

 #define ll long long

 #define pa pair<int,int>

 #define for0(i,n) for(int i=0;i<=(n);i++)

 #define for1(i,n) for(int i=1;i<=(n);i++)

 #define for2(i,x,y) for(int i=(x);i<=(y);i++)

 #define for3(i,x,y) for(int i=(x);i>=(y);i--)

 #define mod 1000000009

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>=''&&ch<=''){x=*x+ch-'';ch=getchar();}

     return x*f;

 }
 int n,tot,s[maxn],a[maxn],c[maxn];
 struct rec{int x,y;}b[maxn];
 inline void change(int x,int y)
 {
     if(!y)return;
     for(;x<=tot;x+=x&(-x))s[x]=(s[x]+y)%mod;
 }
 inline int sum(int x)
 {
     int t=;
     for(;x;x-=x&(-x))t=(t+s[x])%mod;
     return t;
 }
 inline bool cmp(rec a,rec b){return a.x<b.x;}

 int main()

 {

     freopen("input.txt","r",stdin);

     freopen("output.txt","w",stdout);

     n=read();
     for1(i,n)a[i]=a[i-]+read(),b[i].x=a[i],b[i].y=i;
     sort(b,b+n+,cmp);
     tot=;
     for0(i,n)
     {
         if(i==||b[i].x!=b[i-].x)tot++;
         c[b[i].y]=tot;
     }
     change(c[],);
     for1(i,n-)change(c[i],sum(c[i]));
     printf("%d\n",sum(c[n]));

     return ;

 }