树状数组
关注
分享
扫一扫
lizhaowei213
活着就为改变世界！
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2299 Ultra-QuickSort
A - Ultra-QuickSortTime Limit:7000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2299DescriptionIn this problem, you have to analyze a particular原创 2015-08-10 15:42:28 · 402 阅读 · 0 评论 -
POJ 2352 Stars
B - StarsTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2352DescriptionAstronomers often examine star maps where stars are repres原创 2015-08-10 19:48:33 · 465 阅读 · 0 评论 -
POJ 2029 Get Many Persimmon Trees
C - CTime Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2029DescriptionSeiji Hayashi had been a professor of the Nisshinkan Samurai Schoo原创 2015-08-11 15:06:26 · 400 阅读 · 0 评论 -
CSU 1335 高桥和低桥
1335: 高桥和低桥Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 924 Solved: 267[Submit][Status][Web Board]Description有个脑筋急转弯是这样的：有距离很近的一高一低两座桥，两次洪水之后高桥被淹了两次，低桥却只被淹了一次，为什么？答案是：因为低桥太低了，第一次洪水退去之原创 2015-08-23 21:36:23 · 595 阅读 · 0 评论 -
POJ 2155 Matrix
C - MatrixTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticePOJ 2155DescriptionGiven an N*N matrix A, whose elements are either 0 or 1.原创 2015-08-10 21:36:54 · 336 阅读 · 0 评论 -
HDU 2227 Find the nondecreasing subsequences
B - BTime Limit:5000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 2227DescriptionHow many nondecreasing subsequences can you find in the sequence S原创 2015-08-15 21:29:39 · 378 阅读 · 0 评论