摘要： 状态压缩,记录路径 1 #include <iostream> 2 #include <string.h> 3 #include <stdio.h> 4 using namespace std; 5 const int maxx=100000; 6 char c[4][4]; 7 int que[maxx],cnt,step[maxx],n; 8 struct FF 9 { 10 int fa; 11 int path; 12 }; 13 FF father[maxx]; 14 int t[16]={63624,62532,61986,61713,36744 阅读全文