usaco--fence8

题解见nocow，学到的二分答案搜索挺有用的，然后就是搜索的剪枝技巧，下面见代码~~

#include<iostream>
#include<fstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,m,b[60],tb[60],r[1300];
int sum,sumr[1300],sp,mid;
ifstream fin("fence8.in");
ofstream fout("fence8.out");
void init()
{
fin>>n;sum=0;
for(int i=1;i<=n;i++)
{
fin>>b[i];tb[i]=b[i];sum+=b[i];
}
fin>>m;
for(int i=1;i<=m;i++)
fin>>r[i];
}
bool dfs(int dep,int pos)
{
if(dep<1)return 1;
if(sp>sum-sumr[mid])return 0;
for(int i=n;i>=pos;i--)
{
if(b[i]>=r[dep])
{
b[i]-=r[dep];
if(b[i]<r[1])sp+=b[i];
if(r[dep]==r[dep-1])
{
if(dfs(dep-1,i))return 1;
}
else if(dfs(dep-1,1))return 1;
if(b[i]<r[1])sp-=b[i];
b[i]+=r[dep];
}
}
return 0;
}
void slove()
{
sort(tb+1,tb+1+n);
sort(r+1,r+1+m);
for(int i=1;i<=m;i++)
sumr[i]=sumr[i-1]+r[i];
while(sum<sumr[m])m--;
int left=0,right=m;mid=(left+right)/2;
while(left<=right)
{
for(int i=1;i<=n;i++)b[i]=tb[i];
sp=0;
if(dfs(mid,1))left=mid+1;
else right=mid-1;
mid=(left+right)/2;
}
fout<<mid<<endl;
}
int main()
{
init();
slove();
return 0;
}