为了使得在暴力dfs判断选完将之后剩下的牌是否构成刻子和顺子;要用now【34】数组记录每张牌的个数,并且一直从有牌的内个最小编号牌判断其是否属于某个刻子或顺子;而且他所属顺子一定以他为最小值;
#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 136 + 10;
const char* mahjong[]={
"1T","2T","3T","4T","5T","6T","7T","8T","9T",
"1S","2S","3S","4S","5S","6S","7S","8S......
阅读全文