2018年5月15日
POJ3264——Balanced Lineup（线段树查询区间最大最小值）
摘要： Time limit5000 msCase time limit2000 msMemory limit65536 kBFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up... 阅读全文
posted @ 2018-05-15 21:46 Assassin_poi君 阅读(190) 评论(0) 推荐(0)
HDU1698——Just a Hook（线段树区间修改，区间求和）
摘要： In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several cons... 阅读全文
posted @ 2018-05-15 20:36 Assassin_poi君 阅读(133) 评论(0) 推荐(0)
POJ3468——A Simple Problem with Integers （线段树区间加值，区间求和）
摘要： Time limit5000 msCase time limit2000 msMemory limit131072 kBYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of ... 阅读全文
posted @ 2018-05-15 20:13 Assassin_poi君 阅读(120) 评论(0) 推荐(0)