- 博客(5)
- 收藏
- 关注
RSS订阅原创 Can you answer these queries? （线段树）
Can you answer these queries? A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battle...
2018-09-27 21:04:54
638
原创 Balanced Lineup （线段树）
Balanced Lineup For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a game of Ultimate Frisbee with some of the c...
2018-09-23 16:56:24
330
原创 Just a Hook （线段树）
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 consecutive metallic sticks which are of the same leng...
2018-09-23 16:04:58
366
原创 A Simple Problem with Integers POJ - 3468（线段树）
A Simple Problem with Integers You have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given inter...
2018-09-23 11:04:10
129
原创 I Hate It HDU - 1754 （线段树）
I Hate It 很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。 Input 本题目包含多组测试，请处理到文件结束。 在每个测试的第一行，有两个正整数 N 和 M ( 0<N<=200000,...
2018-09-23 11:01:24
152
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人