与‘数据结构-线段树’有关的日志

poj2182

maksyuki 发表于 oj 分类,标签:
0
poj2182

Lost Cows

N (2 <= N <= 8,000) cows have unique brands in the range 1..N. In a spectacular display of poor judgment, they visited the neighborhood 'watering hole' and drank a few too many beers before dinner. When it was time to line up for th >>继续阅读

hdu2795

maksyuki 发表于 oj 分类,标签:
0
hdu2795

Billboard

Problem Description

At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements are posted: nearest programming compe >>继续阅读

hdu1394

maksyuki 发表于 oj 分类,标签:
0
hdu1394

Minimum Inversion Number

Problem Description

The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i < j and ai > aj.

For a given sequence of numbers a1, a2, ..., an, if we move the f >>继续阅读

poj3468

maksyuki 发表于 oj 分类,标签:
0
poj3468

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 interval. The other is to ask for the sum of numbers in >>继续阅读

poj3264

maksyuki 发表于 oj 分类,标签:
0
poj3264

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 cows. To keep things simple, he will take a contiguou >>继续阅读

poj2777

maksyuki 发表于 oj 分类,标签:
0
poj2777

Count Color

Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem. There is a very long board with length L centimeter, L is a positive integer, so we can evenly >>继续阅读

poj2528

maksyuki 发表于 oj 分类,标签:
0
poj2528

Mayor's posters

The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided to build an electoral wal >>继续阅读

poj2352

maksyuki 发表于 oj 分类,标签:
0
poj2352

Stars

Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to the right of the given star. Astron >>继续阅读

poj1151

maksyuki 发表于 oj 分类,标签:
0
poj1151

Atlantis

There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps describe different >>继续阅读

hdu1754

maksyuki 发表于 oj 分类,标签:
0
hdu1754

I Hate It

Problem Description

很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。

这让很多学生很反感。

不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序 >>继续阅读

hdu1698

maksyuki 发表于 oj 分类,标签:
0
hdu1698

Just a Hook

Problem Description

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 length. >>继续阅读

hdu1166

maksyuki 发表于 oj 分类,标签:
0
hdu1166

敌兵布阵

Problem Description

C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务 >>继续阅读

vijos1448

maksyuki 发表于 oj 分类,标签:
0
vijos1448

描述

校门外有很多树,有苹果树,香蕉树,有会扔石头的,有可以吃掉补充体力的……

如今学校决定在某个时刻在某一段种上一种树,保证任一时刻不会出现两段相同种类的树,现有两个操作: >>继续阅读

lightoj1183

maksyuki 发表于 oj 分类,标签:
0
lightoj1183

1183 - Computing Fast Average

1 i j v - change the value of the elements from ith index to jth index to v.Given an array of integers (0 indexed), you have to perform two types of queries in the array.

2 i j - find the average value of the inte >>继续阅读

lightoj1164

maksyuki 发表于 oj 分类,标签:
0
lightoj1164

1164 - Horrible Queries

0 x y v - you have to add v to all numbers in the range of x to y (inclusive), where x and y are two indexes of the array.World is getting more evil and it's getting tougher to get into the Evil League of Evil. Since the leg >>继续阅读

lightoj1112

maksyuki 发表于 oj 分类,标签:
0
lightoj1112

1112 - Curious Robin Hood

Now each time he can he can do one of the three tasks.Robin Hood likes to loot rich people since he helps the poor people with this money. Instead of keeping all the money together he does another trick. He keeps n sacks w >>继续阅读