OJ Board

#include<iostream>
#define INF 1<<20
#define min(a,b) (a<b?a:b)
#define MAX 100
using namespace std;

int B[]={-INF,INF,INF,INF,INF,INF,INF,INF,INF,INF,INF,INF};

int bin(int key)
{
int v;
int lo=0;
int hi=11;
int mid;
while(lo<=hi)
{
mid=lo+(hi-lo)/2;
if(B[mid]>key)
{
v=mid;
hi=mid-1 ...

WA WA WA :(
where is the problem ??


#include<cstdio>
#include<sstream>
#include<cstdlib>
#include<cctype>
#include<cmath>
#include<algorithm>
#include<set>
#include<queue>
#include<stack>
#include<list>
#include<iostream>
#include<fstream>
#include<numeric>
#include<string>
#include<vector ...