原创 hdu 5656 CA Loves GCD(n個任選k個的最大公約數和)
CA Loves GCD Accepts: 64 Submissions: 535 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262
原创 hdu5651 xiaoxin juju needs help(逆元)
xiaoxin juju needs help Accepts: 150 Submissions: 966 Time Limit: 2000/1000 MS (Java/Others) Memory Limit
原创 hdu 4267 線段樹間隔更新
A Simple Problem with Integers Time Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) To
原创 hdu 1828 線段樹掃描線(周長)
Picture Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3897
原创 POJ 3261 可重疊k次最長重複子串
Milk Patterns Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 13127 Accepted: 5842 Case Time Limit: 2
原创 hdu 4747 線段樹
Mex Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 2482
原创 hdu 1255 覆蓋的面積(求覆蓋至少兩次以上的面積)
了校賽,還有什麼途徑可以申請加入ACM校隊? 覆蓋的面積 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
原创 hdu 1542 線段樹掃描(面積)
Atlantis Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 102
原创 POJ 3415 不小於k的公共子串的個數
Common Substrings Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 9248 Accepted: 3071 Description
原创 URAL 1297 最長迴文子串(後綴數組)
1297. Palindrome Time limit: 1.0 second Memory limit: 64 MB The “U.S. Robots” HQ has just received a rather alarmi
原创 hdu 3308 最長連續上升區間
LCIS Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6066
原创 hdu 4052 線段樹掃描線、奇特處理
Adding New Machine Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submiss
原创 5650 so easy
so easy Accepts: 512 Submissions: 1601 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K
原创 hdu 4027 Can you answer these queries?
Can you answer these queries? Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Tot
原创 SPOJ - DISUBSTR 多少個不同的子串
694. Distinct Substrings Problem code: DISUBSTR Given a string, we need to find the total number of its dis