vsooda的专栏

#include using namespace std; char list[50001][26]; const int kind = 26; int cnt = 0; struct Treenode { bool flag; Treenode *next[kind]; Treenode() { flag = false; f

#include #include using namespace std; const int MAXNODE = 500000; const int BRANCH = 10; int tree[MAXNODE][BRANCH]; int SIZE; //结点下标 bool key[MAXNODE];//是否是某个单词 bool Insert(char *str) { int node

#include #include using namespace std; const int N = 3010; int a[N]; int visit[N]; int main() { int n; while(cin >> n) { memset(a, 0, sizeof(a)); memset(visit, 0, sizeof(visit)); for(int i