摘要：
传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=3223 思路:15?好,状压,OＫ． 这是转移方程 if((s[k]&j)==s[k]) f[i][j]+=max(f[i+1][j],f[i+1][j|1 include include in 阅读全文
摘要：
传送门:http://poj.org/problem?id=2774 裸的后缀数组,我只是为了贴个版而已 代码 c++ include include include include include define ll long long define mod 1000000007 using na 阅读全文
摘要：
原博客http://blog.csdn.net/chen20000804/ 手动搬了几篇博客,总结性的和水的题就没有搬了. 阅读全文