原创 HDU - 6198 number number number(規律+矩陣快速冪)
number number number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submiss
原创 ZOJ - 3607 Lazier Salesgirl(模擬)
Lazier Salesgirl Time Limit: 2 Seconds Memory Limit: 65536 KB Kochiya Sanae is a lazy girl who makes and sells bre
原创 HDU - 3974 Assign the task (DFS序 + 線段樹區間染色)
Assign the task Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(
原创 HDU - 1671 Phone List (字典樹)
Phone List Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 21
原创 HDU - 6025 Coprime Sequence(前綴,後綴,gcd)
Coprime Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submissio
原创 HDU - 1251 統計難題(字典樹模板題)
統計難題 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 45711
原创 HDU - 3336 Count the string(KMP+DP)
Count the string Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(
原创 HDU - 2874 Connections between cities(並查集+LCA)
Connections between cities Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tota
原创 HDU - 1042 N!(高精度BigInt)
N! Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 86335
原创 CF#877 B. Nikita and string(思維,暴力)
B. Nikita and string time limit per test 2 seconds memory limit per test 256 megabytes input standard input
原创 ACM所有算法
轉載自:http://blog.sina.com.cn/s/blog_adb6743801019h29.html ACM 所有算法 數據結構 棧,隊列,鏈表 哈希表,哈希數組 堆,優先隊列 雙端隊列 可並堆 左偏堆 二叉查找
原创 HDU - 1024 Max Sum Plus Plus(dp求最大m子段和)
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s)
原创 CF#877 A. Alex and broken contest(KMP)
A. Alex and broken contest time limit per test 2 seconds memory limit per test 256 megabytes input standard
原创 C++ string 字符串查找匹配
在寫C++程序中,總會遇到要從一個字符串中查找一小段子字符串的情況,對於在C中,我們經常用到strstr()或者strchr()這兩種方法。而對於C++的string,我們往往會用到find()。 C++:#inlcude<strin
原创 POJ - 2155 Matrix(二維線段樹、區間更新單點查詢)
Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 29732 Accepted: 10863 Description Given an N*