字典树
lqybzx
123
展开
-
5-14 数据结构啊poi H.许多的游戏
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=78124#problem/H //想看题目的@willinglive 首先我们根据给出的字符串建立字典树 然后在字典树上dfs求出先手可否必赢和先手可否必输,记flag1和flag2 if(flag1) { if(flag2)原创 2015-05-15 20:55:07 · 514 阅读 · 0 评论 -
2016多校训练Contest9: 1002 Best Division hdu5845
Problem Description You are given an array A, consisting of N integers. You are also given 2 integers K and L. You must divide the whole array A into exactly K nonempty intervals, such that t原创 2016-08-17 00:22:44 · 927 阅读 · 4 评论