08 2014 档案

HDU 1247
摘要：简单的字典树 - -，求一个单词是否由两个单词组成#include#include#includeusing namespace std;#define maxn 26struct node{ int sum; node *next[26];};node *root;char a[50005][... 阅读全文
posted @ 2014-08-11 16:47 无忧望月 阅读(107) 评论(0) 推荐(0)
poj 3436 ACM Computer Factory
摘要：#include#include#include#include#includeusing namespace std;#define maxn 100#define INF 0xfffffffint G[maxn+10][maxn+10], CopyG[maxn+10][maxn+10];int ... 阅读全文
posted @ 2014-08-04 16:21 无忧望月 阅读(121) 评论(0) 推荐(0)

levels of contents