usaco 2.1.4 holstein II

这是用dfs写出来的，照样调试用了很多时间，有待加强啊！！下面贴出代码，以作纪念。

/*{
ID:jzy3209981
PROG:holstein
LANG:C++
}*/
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<math.h>
using namespace std;

int scoop[15][25];
int vitamin[25];
int minn;
int order[15];
int ord[15];
void dfs(int a,int v,int g,int n,int ori[25])
{
    
    int copy[25];
    int i,j,state;
    if(a>=g)
        return ;
    for(i=a;i<g;i++)
    {
        memcpy(copy,ori,25*sizeof(int));
        state=0;
        ord[n]=i;
        for(j=0;j<v;j++)
        {
            copy[j]-=scoop[i][j];
            if(copy[j]>0)
                state=1;        
        }    

        if(state==0)
        {
            if(n+1<minn)
            {
                minn=n+1;
                memcpy(order,ord,15*sizeof(int));
            }
        }        
        dfs(i+1,v,g,n+1,copy);
    }
}

int main()
{
    freopen ("holstein.in","r",stdin);
    freopen ("holstein.out","w",stdout);
    int v,i,g,j;
    minn=15;
    scanf("%d",&v);
    for(i=0;i<v;i++)
        scanf("%d",&vitamin[i]);
    scanf("%d",&g);
    for(i=0;i<g;i++)
        for(j=0;j<v;j++)
            scanf("%d",&scoop[i][j]);
    dfs(0,v,g,0,vitamin);
    printf("%d ",minn);
    for(i=0;i<minn;i++)
    {
        if(i==minn-1)
            printf("%d\n",order[i]+1);
        else
            printf("%d ",order[i]+1);
    }
    return 0;
}