原创 POJ2488:A Knight's Journey
點擊打開題目鏈接 A Knight's Journey Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 25877 Accepted: 8829 Desc
2020-06-14 15:25:14
原创 POJ3041:Asteroids
點擊打開題目鏈接 Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12568 Accepted: 6829 Description
2020-06-14 15:25:14
原创 HDU1869:六度分離
點擊打開題目鏈接 六度分離 Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s
2020-06-14 15:25:14
原创 HDU1677:Nested Dolls
點擊打開題目鏈接 Nested Dolls Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submi
2020-06-14 15:25:14
原创 HDU3874:Necklace
點擊打開題目鏈接 Necklace Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submissi
2020-06-14 15:25:03
原创 HDU2227:Find the nondecreasing subsequences
點擊打開題目鏈接 Find the nondecreasing subsequences Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (
2020-06-14 15:25:03
原创 HDU2255:奔小康賺大錢
點擊打開題目鏈接 奔小康賺大錢 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(
2020-06-14 15:25:03
原创 [Virtual Judge]ZOJ1610:Count the Colors
點擊打開題目鏈接 =====================================題目大意===================================== 在一條直線上給某些區間染色，染色時之前染的顏色會被覆蓋，
2020-02-21 01:28:05
原创 [模板]最長有序子序列
/*#######################################[ LOS Templet Of Lyz ]#######################################*/ typedef boo
2020-02-21 01:28:04
原创 HDU1257:最少攔截系統
點擊打開題目鏈接 最少攔截系統 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(
2020-02-21 01:28:03
原创 POJ3321:Apple Tree
點擊打開題目鏈接 Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16270 Accepted: 4872 Description
2020-02-21 01:28:03
原创 HDU3665:Seaside
點擊打開題目鏈接 Seaside Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission
2020-02-21 01:28:02
原创 POJ2239:Selecting Courses
點擊打開題目鏈接 Selecting Courses Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7814 Accepted: 3463 Descri
2020-02-21 01:28:02
原创 滾動數組優化陷阱
昨晚contest的Problem E，freezhan學姐用揹包寫AC了，但是優化成一維後連樣例都過不了，然後我就研究了一下。 這是優化前的代碼： F[0][0]=1; for(int i=1;i<=N;++i) {
2020-02-21 01:28:02
原创 HDU3790:最短路徑問題
點擊打開題目鏈接 最短路徑問題 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(
2020-02-21 01:28:02