我写的错误朴素，结果A了，话说BST的数据是有多弱啊....
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=1000+100;
int T,n,tree[maxn],ma[maxn],mi[maxn];
bool sign;
void work(int t);
void init()
{
freopen("steak.in","r",stdin);
freopen("steak.out","w",stdout);
}
bool les()
{
for(int i=1;i<=n;i++)
{
if((i<<1)>n)break;
if(tree[(i<<1)]>=tree[i])
{
if((i<<1)+1>n)break;
if(tree[(i<<1)+1]<tree[i])return false;
}
else return false;
}return true;
}
bool gre()
{
for(int i=1;i<=n;i++)
{
if((i<<1)>n)break;
if(tree[(i<<1)]<=tree[i])
{
if((i<<1)+1>n)break;
if(tree[(i<<1)+1]>tree[i])return false;
}
else return false;
}return true;
}
bool inc()
{
for(int i=1;i<=n;i++)
{
int x=i<<1;
if(x<=n)
{
if(tree[x]<=tree[i])
{
if(x+1<=n)
{
if(tree[x+1]<tree[i])return false;
}else break;
}else return false;
}else break;
}return true;
}
bool dec()
{
for(int i=1;i<=n;i++)
{
int x=i<<1;
if(x<=n)
{
if(tree[x]>=tree[i])
{
if(x+1<=n)
{
if(tree[x+1]>tree[i])return false;
}else break;
}else return false;
}else break;
}return true;
}
int read()
{
int data=0;char lie=getchar();
while(lie>'9' || lie<'0')lie=getchar();
do
{
data=data*10+lie-'0';
lie=getchar();
}while(lie>='0' && lie<='9');
return data;
}
void readdata()
{
T=read();
for(int t=1;t<=T;t++)
{
n=read();
for(int i=1;i<=n;i++)tree[i]=read();
work(t);
}
}
void work(int t)
{
printf("Case #%d: ",t);
bool heap=0;
if(les()||gre())heap=1;
bool sor=0;
if(inc()||dec())sor=1;
if(heap && sor)
{
printf("Both\n");
}
else if(heap && !sor)
{
printf("Heap\n");
}
else if(!heap&& sor)
{
printf("BST\n");
}
else printf("Neither\n");
}
int main()
{
//init();
readdata();
return 0;
}
关于bst的朴素是错的吧！！这也能A！