hdu2041(二分)

#include
#include
#include
#include
#include
#include
#include
using namespace std;
const int maxn = 505;
int ant;
int flag=0;
int l,n,m,s,ca=1;
int a[maxn],b[maxn],c[maxn],x,sum[maxn*maxn];
int search(int x)
{
	int left=1,right=ant-1;
	int mid;
	while(left<=right)
	{
		mid=(right-left)/2+left;
		if(sum[mid]==x)
		{
			return 1;
		}
		else if(sum[mid]>l>>n>>m)
	{
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		memset(c,0,sizeof(c));
		memset(sum,0,sizeof(sum));
	for(int i=0;i>a[i];
	}
	for(int i=0;i>b[i];
	}
	for(int i=0;i>c[i];
	}
	ant=0;
	for(int i=0;i>s;
	cout<<"Case "<>x;
		flag=0;
		for(int j=0;j

 

你可能感兴趣的:(ACM)