2017年11月_Mitsuha_

原创 Codeforces-739B：Igor and his way to work（BFS+优化）

Codeforces-739B：Igor and his way to work（BFS+优化）Woken up by the alarm clock Igor the financial analyst hurried up to the work. He ate his breakfast and sat in his car. Sadly, when he opened his GPS navigator, he found that some of the roads in Bankopolis,

2017-11-29 19:31:31 580

原创 Codeforces-343D：Water Tree（树链剖分）

Codeforces-343D：Water Tree（树链剖分）Mad scientist Mike has constructed a rooted tree, which consists of n vertices. Each vertex is a reservoir which can be either empty or filled with water.The vertices of the tree are numbered from 1 to n with the root at v

2017-11-25 10:09:12 465

原创 FZU - 2082：过路费（树链剖分）

FZU - 2082：过路费（树链剖分）有n座城市，由n-1条路相连通，使得任意两座城市之间可达。每条路有过路费，要交过路费才能通过。每条路的过路费经常会更新，现问你，当前情况下，从城市a到城市b最少要花多少过路费。

2017-11-24 13:40:47 411

原创 POJ-3237：Tree（树链剖分）

POJ-3237：Tree（树链剖分）You are given a tree with N nodes. The tree’s nodes are numbered 1 through N and its edges are numbered 1 through N − 1. Each edge is associated with a weight. Then you are to execute a series of instructions on the tree. The instruction

2017-11-23 23:04:48 345

原创 SPOJ-tree：Query on a tree （树链剖分）

SPOJ-tree：Query on a tree （树链剖分）You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instructions of the following form:CHANGE i ti : change the cost of the i-th edg

2017-11-23 19:18:59 309

原创 UESTC - 425：Defense Lines（排序+线段树）

UESTC - 425：Defense Lines（排序+线段树）After the last war devastated your country, you - as the king of the land of Ardenia - decided it was high time to improve the defense of your capital city. A part of your fortification is a line of mage towers, starting ne

2017-11-21 23:19:51 234

原创 HDU-6242：Geometry Problem（随机化+几何）

Geometry Problem Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) ...

2017-11-21 22:56:16 662 2

原创 HDU-5858：Hard problem（相交圆面积）

HDU-5858：Hard problem（相交圆面积）cjj is fun with math problem. One day he found a Olympic Mathematics problem for primary school students. It is too difficult for cjj. Can you solve it?Give you the side length of the square L, you need to calculate the shaded a

2017-11-18 09:15:31 371

原创 Codeforces-191C： Fools and Roads（LCA）

Codeforces-191C： Fools and Roads（LCA）They say that Berland has exactly two problems, fools and roads. Besides, Berland has n cities, populated by the fools and connected by the roads. All Berland roads are bidirectional. As there are many fools in Berland,

2017-11-16 22:42:16 847

原创 Codeforces-888E：Maximum Subsequence（思维）

Codeforces-888E：Maximum Subsequence（思维）You are given an array a consisting of n integers, and additionally an integer m. You have to choose some sequence of indices b1, b2, ..., bk (1 ≤ b1 < b2 < ... < bk ≤ n) in such a way that the value of is maximized.

2017-11-13 15:23:53 576

原创 HDU-6237：A Simple Stone Game（数论）

HDU-6237：A Simple Stone Game（数论）After he has learned how to play Nim game, Bob begins to try another stone game which seems much easier.The game goes like this: one player starts the game with N piles of stones. There is ai stones on the ith pile. On one

2017-11-11 22:36:22 707

原创 Codeforces-652D ： Nested Segments（线段树）

Codeforces-652D ： Nested Segments（线段树）You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.

2017-11-10 17:48:51 296

原创 Codeforces-830B：Cards Sorting（树状数组+线段树）

Codeforces-830B：Cards Sorting（树状数组+线段树）Vasily has a deck of cards consisting of n cards. There is an integer on each of the cards, this integer is between 1 and 100 000, inclusive. It is possible that some cards have the same integers on them.Vasily deci

2017-11-05 11:53:12 461

Mitsuha_的博客