第一次如果选择了0,那么3和6的恐慌值就会增加到5,第二次不管怎么选择,3和6总会有一个超过5.

#include<stdio.h>
#include<string.h>#define N 20

typedef struct
{int hp ,zhou;
}NODE;typedef struct
{int a ,b ,c;
}Q;int Z[10][N];
NODE node[N];
Q qq[105];int max_ans;
int K ,n;void DFS(int deep)
{if(max_ans < deep) max_ans = deep;if(deep == K + 1) return ;int a = qq[deep].a;int b = qq[deep].b;int c = qq[deep].c;//1
   NODE mk_node[N]; int i;for(i = 1 ;i <= n ;i ++)mk_node[i] = node[i]; node[a].hp -= 2;if(node[a].hp < 1) node[a].hp = 1;node[b].hp += 1,node[c].hp += 1;for(i = 1 ;i <= Z[node[b].zhou][0] ;i ++)node[Z[node[b].zhou][i]].hp ++;for(i = 1 ;i <= Z[node[c].zhou][0] ;i ++)node[Z[node[c].zhou][i]].hp ++;for(i = 1 ;i <= n ;i ++)if(node[i].hp > 5) break;if(i == n + 1 && max_ans != K + 1)DFS(deep + 1);for(i = 1 ;i <= n ;i ++)node[i] = mk_node[i];//2
   for(i = 1 ;i <= n ;i ++)mk_node[i] = node[i]; node[b].hp -= 2;if(node[b].hp < 1) node[b].hp = 1;node[a].hp += 1,node[c].hp += 1;for(i = 1 ;i <= Z[node[a].zhou][0] ;i ++)node[Z[node[a].zhou][i]].hp ++;for(i = 1 ;i <= Z[node[c].zhou][0] ;i ++)node[Z[node[c].zhou][i]].hp ++;for(i = 1 ;i <= n ;i ++)if(node[i].hp > 5) break;if(i == n + 1 && max_ans != K + 1)DFS(deep + 1);for(i = 1 ;i <= n ;i ++)node[i] = mk_node[i];//3
   for(i = 1 ;i <= n ;i ++)mk_node[i] = node[i]; node[c].hp -= 2;if(node[c].hp < 1) node[c].hp = 1;node[a].hp += 1,node[b].hp += 1;for(i = 1 ;i <= Z[node[a].zhou][0] ;i ++)node[Z[node[a].zhou][i]].hp ++;for(i = 1 ;i <= Z[node[b].zhou][0] ;i ++)node[Z[node[b].zhou][i]].hp ++;for(i = 1 ;i <= n ;i ++)if(node[i].hp > 5) break;if(i == n + 1 && max_ans != K + 1)DFS(deep + 1);for(i = 1 ;i <= n ;i ++)node[i] = mk_node[i];
}int main ()
{int i ,j ,m ,t ,cas = 1;int a;scanf("%d" ,&t);while(t--){scanf("%d %d %d" ,&n ,&m ,&K);memset(Z ,0 ,sizeof(Z));for(i = 1 ;i <= n ;i ++){scanf("%d" ,&node[i].zhou);node[i].zhou ++;        Z[node[i].zhou][0]++;Z[node[i].zhou][Z[node[i].zhou][0]] = i;}for(i = 1 ;i <= n ;i ++)scanf("%d" ,&node[i].hp);for(i = 1 ;i <= K ;i ++){scanf("%d %d %d" ,&qq[i].a ,&qq[i].b ,&qq[i].c);qq[i].a ++ ,qq[i].b ++ ,qq[i].c ++;}max_ans = 1;DFS(1);printf("Case #%d: %d\n" ,cas ++ ,max_ans - 1);}return 0;
}