Skip to content

Menu

特设页面

Search for:

Search for:

Close search bar

特设页面

Search for:

Tags

ACM BFS BSGS CF DFS FZU HDU KMP Linux LRJ Misc POJ SGU SPOJ STL Trie UVA ZOJ 二分二分图二进制枚举前缀和动态规划区间DP 博弈后缀自动机图论基础题字符串处理小总结找规律数学数据结构数论斜率优化DP 暴力构造树树DP 概率DP 模拟线段树背包DP 贪心递推

Recent Posts

最短路教程
Codeforces 666C Codewords
Codeforces 295D Greg and Caves
后缀数组
单模式串匹配问题与KMP算法

Recent Comments

wingkou on POJ 3744 Scout YYF I
给中级者的动态规划教程 | hahaschool on POJ 1655 Balancing Act
给中级者的动态规划教程 | hahaschool on POJ 2955 Brackets
萨摩公园 on 2015 SCUT 集训队选拔
萨摩公园 on Hello world!

Archives

February 2017
October 2016
September 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
May 2015
April 2015
March 2015
February 2015
January 2015

Categories

Algorithm
C++
Linux
Raspberry Pi
Tutorials
Uncategorized
数据结构
比赛报告
瞎划拉的
算法
解题报告
课业

Meta

Log in
Entries feed
Comments feed
WordPress.org

Follow me on Twitter

Top Posts & Pages

最短路教程
Codeforces 666C Codewords
Codeforces 295D Greg and Caves
2016 SCNUAH Course
后缀数组
单模式串匹配问题与KMP算法
最长回文子串和Manacher算法
给中级者的动态规划教程
LA4394 String Painter
LA3725 Hie with the Pie

Links

kaildls @ 雜 | 避暑聖地
meto @ 萨摩公园
SPtuan @ Steins;Lab

Copyright © 2024 hahaschool – Theme by Puro

Scroll to top