hdu 6149 Valley Numer II (状态压缩dp)

枚举每个低点，最多和多少个高点，取最大值

#include
using namespace std;
typedef long long  ll;
int h[50],a[50],map1[50][50];
int dp[2][(1<<15)+10];

int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t;
    scanf("%d",&t);
    int n,m,k,x,y;
    while(t--)
    {
        scanf("%d%d%d",&n,&m,&k);
        memset(map1,0,sizeof(map1));
        memset(dp,0,sizeof(dp));
        memset(h,0,sizeof(h));
        for(int i=1; i<=m; i++)
            {scanf("%d%d",&x,&y),map1[x][y]=1;
        map1[y][x]=1;}
        for(int i=0; i