【DP】poj1722

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<cstring>
using namespace std;
int T,n,a[101000],f[110][20100],biao[110];
int main()
{
while (~scanf("%d%d",&n,&T))
{
memset(f,0,sizeof(f));
memset(biao,0,sizeof(biao));
for (int i=1;i<=n;i++)
scanf("%d",&a[i]);
f[1][10000+a[1]]=2;
f[2][10000+a[1]-a[2]]=1;
for (int i=3;i<=n;i++)
for (int j=0;j<=20000;j++)
{
if (f[i-1][j]<=0) continue;
if (j+a[i]<=20000) f[i][j+a[i]]=2;
if (j-a[i]>=0) f[i][j-a[i]]=1;
//printf("%d\n",f[3][10006]);
}
for (int i=n,j=10000+T;i;i--)
{
//cout<<i<<" "<<f[i][j]<<" "<<j<<endl;
if (f[i][j]==1)
{
biao[i]=1;
j=j+a[i];
}
else
{
biao[i]=2;
j=j-a[i];
}
}
for (int i=2,cnt=0;i<=n;i++)
if (biao[i]==2)
{
printf("%d\n",i-1-cnt);
cnt++;
}
for (int i=2;i<=n;i++)
if (biao[i]==1)
printf("1\n");
}
return 0;
}