1 const p=1000000009;
 2 var
 3    n,i,j:longint;
 4    a,s,f:array[0..100000] of longint;
 5
 6 function sum(i,j:longint):longint;
 7 begin
 8   exit(s[j]-s[i]);
 9 end;
10
11 procedure add(var app:longint; aa:longint);
12 begin
13   app:=((app mod p)+(aa mod p)) mod p;
14 end;
15
16 begin
17     readln(n);
18     for i:= 1 to n do
19     begin
20       readln(a[i]);
21       s[i]:=s[i-1]+a[i];
22     end;
23
24     f[0]:=1;
25     for i:= 1 to n do
26      for j:= 0 to i-1 do
27         if sum(j,i)>=0 then add(f[i],f[j]);
28
29     writeln(f[n]);
30 end.

 1 program w;
 2 const
 3   p=1000000009;
 4
 5 var
 6    n,i,ans:longint;
 7    sum,a,rk,f,tree:array[0..100000] of longint;
 8
 9 function lowbit(app:longint):longint;
10 begin
11     exit(app and -app);
12 end;
13
14 procedure add(ii,x:longint);
15 begin
16   while ii<=n do
17    begin
18      tree[ii]:=(tree[ii]+x) mod p;
19      ii:=ii+lowbit(ii);
20    end;
21 end;
22
23 function get(aa:longint):longint;
24 begin
25   get:=0;
26   while aa>0 do
27   begin
28       get:=(get+tree[aa]) mod p;
29       aa:=aa-lowbit(aa);
30   end;
31 end;
32
33 procedure qsort(l,r: longint);
34   //注意一定要双字段
35 var
36   i,j,x,y,z: longint;
37 begin
38   i:=l;  j:=r;  x:=sum[(l+r) div 2];  z:=rk[(l+r) div 2];
39   repeat
40     while (sum[i]<x) or ((sum[i]=x) and (rk[i]<z)) do inc(i);
41     while (x<sum[j]) or ((sum[j]=x) and (rk[j]>z)) do dec(j);
42     if not(i>j) then
43     begin
44       y:=sum[i]; sum[i]:=sum[j];  sum[j]:=y;
45       y:=rk[i]; rk[i]:=rk[j];  rk[j]:=y;
46       inc(i);  j:=j-1;
47     end;
48   until i>j;
49   if l<j then qsort(l,j);
50   if i<r then qsort(i,r);
51 end;
52
53 begin
54   readln(n);
55   for i:= 1 to n do
56     readln(a[i]);
57
58   n:=n+1;  sum[1]:=0;  rk[1]:=1;
59   for i:= 2 to n do
60   begin
61    sum[i]:=sum[i-1]+a[i-1];
62    rk[i]:=i;
63   end;
64
65   qsort(1,n);
66
67   for i:= 1 to n do
68     f[rk[i]]:=i;
69
70   add(f[1],1);   //处理边界
71   for i:= 2 to n do  //循环到i ，得出来的ans便是f[i]的值
72   begin
73       ans:=get(f[i]);
74       add(f[i],ans);
75   end;
76
77   writeln(ans);
78 end.