
离散化
文章平均质量分 83
RJ28
小学生
展开
-
Codeforces Round #361 (Div. 2) E. Mike and Geometry Problem (离散化)
Mike wants to prepare for IMO but he doesn't know geometry, so his teacher gave him an interesting geometry problem. Let's definef([l, r]) = r - l + 1 to be the number of integer points in the segme原创 2016-07-19 10:21:49 · 718 阅读 · 0 评论 -
Hdu-2665 Kth number(主席树)
Problem DescriptionGive you a sequence and ask you the kth big number of a inteval. InputThe first line is the number of the test cases. For each test case, the first line contain原创 2016-10-05 16:05:41 · 272 阅读 · 0 评论 -
Codeforces Round #390 (Div. 2) D. Fedor and coupons
All our characters have hobbies. The same is true for Fedor. He enjoys shopping in the neighboring supermarket.The goods in the supermarket have unique integer ids. Also, for every integer there i原创 2017-01-07 08:35:14 · 531 阅读 · 0 评论 -
SPOJ-COT2 Count on a tree II(树上莫队)
You are given a tree with N nodes. The tree nodes are numbered from 1 to N. Each node has an integer weight.We will ask you to perform the following operation:u v : ask for how many different in原创 2017-01-26 16:30:29 · 511 阅读 · 0 评论 -
Educational Codeforces Round 27 E. Fire in the City(二维离散化)
The capital of Berland looks like a rectangle of size n × m of the square blocks of same size.Fire!It is known that k + 1 blocks got caught on fire (k + 1 ≤ n·m). Those blocks are centers of ignit原创 2017-09-16 10:18:55 · 402 阅读 · 0 评论