- 博客(5)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 HDU 3336-Count the string
HDU 3336 KMP+DP #include #include using namespace std; #define MAX 200005 #define mod 10007 int next[MAX],num[MAX]; char s[MAX]; void get_next() { int i=0,j=-1; next[
2016-06-30 12:13:10
419
原创 HDU 2087-剪花布条
HDU 2087 KMP算法 #include #include #include using namespace std; char a[1001],b[1001]; int nextd[1001]; void gnext() { int l1=strlen(a+1); int l2=strlen(b+1); int s=1,t=0; while(s<=l2) { i
2016-06-30 12:09:07
370
原创 HDU 1358
Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. That is,
2016-06-30 12:07:22
364
原创 HDU 1301-Jungle Roads (Kruscal 最小生成树)
Description The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes r
2016-06-30 12:04:01
811
原创 HDU 1198
并查集 #include #include #include using namespace std; char map[11][5]={"1010","1001","0110","0101","1100","0011", "1011","1110","0111","1101","1111"}; int a[10001],n,m; char aa[201][
2016-06-30 12:02:05
348
MyEclipse 2015 Stable 2.0破解
2015-10-25
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人