September_的博客

#include <cstdio> #include <cstring> #include <algorithm> #include <cstdlib> #include <string> #include <iostream> #include <utility> #include <cstdio

题目链接：  http://codeforces.com/problemset/problem/1070/H 思路：直接找的话，会时间超限，所以可以用map把上面输入的串的所有字串都记下来，用两个map，一个记录有几个串有匹配的，一个记录匹配的串是哪个。 #include<cstdio> #include<iostream> #include <string&g...

Shortest Prefixes Time Limit:1000MS Memory Limit:30000KB Description A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "c...

详解 #include<iostream> #include<algorithm> #include <cstring> #include <string> #include<cstdio> using namespace std; int next[1000],num=0; void GetNextval(char* p, int...

HDU2222 #include<iostream> #include<algorithm> #include<cstring> #include<string> #include<cstdio> #include<queue> using namespace std; struct Trie { Trie *n...