Day4:终于写好了但还是60pts
求助...
`code`
```cpp
#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=200,mod=1e6+7;
int n,m,a[maxn],f[maxn][maxn];
int lowbit(int t){return t&-t;}
void change(int y,int t,int x){
if(t==0){f[y][t]=(f[y][t]+x)%mod;return;}
for(;t<=m;t+=lowbit(t)) f[y][t]=(f[y][t]+x)%mod;
}
int sumget(int y,int t){
int rt=0;
for(;t;t-=lowbit(t)) rt=(rt+f[y][t])%mod;
return rt;
}
int getsum(int y,int l,int r){
if(l<=0) return sumget(y,r)+f[y][0];
return sumget(y,r)-sumget(y,l-1);
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=0;i<=m;i++) f[i][0]=1;
int pre=0;
for(int i=1;i<=n;i++){pre+=a[i];
for(int j=1;j<=m&&j<=pre;j++){
change(i,j,getsum(i-1,j-a[i],j));
}
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
printf("%d ",getsum(i,j,j));
}
printf("\n");
}
printf("%d\n",getsum(n,m,m));
return 0;
}
```
by hbhz_zcy @ 2021-08-08 08:23:28
不用树状数组吧。。。。
by MatrixGroup @ 2021-08-08 09:31:57
@[bilibilitdasc](/user/483824) 现在树状数组调试的没问题了，但还是AK不了
by hbhz_zcy @ 2021-08-08 11:08:49
@[38432386zcy](/user/142549) AK?!
Orz
by MatrixGroup @ 2021-08-08 12:55:57
@[bilibilitdasc](/user/483824)
AK这道题=这道题AC
%%%
by hbhz_zcy @ 2021-08-08 19:09:13