离散化
coldfresh
那我们开始吧
展开
-
Weak Pair HDU - 5877(树状数组+离散化)
You are given a rooted tree of N nodes, labeled from 1 to N. To the ith node a non-negative value ai is assigned.An ordered pair of nodes (u,v) is said to be weak if (1) u is an ancestor of v (Note原创 2017-09-03 19:28:02 · 371 阅读 · 0 评论 -
Color the Ball HDU - 1199(离散化)
There are infinite balls in a line (numbered 1 2 3 ….), and initially all of them are paint black. Now Jim use a brush paint the balls, every time give two integers a b and follow by a char ‘w’ or ‘b’,原创 2017-08-23 16:58:50 · 348 阅读 · 0 评论 -
Counting Intersections HDU - 5862(离散化+树状数组)
Given some segments which are paralleled to the coordinate axis. You need to count the number of their intersection. The input data guarantee that no two segments share the same endpoint, no covered se原创 2017-09-16 00:42:31 · 284 阅读 · 0 评论 -
World is Exploding HDU - 5792 (离散化+树状数组)
Given a sequence A with length n,count how many quadruple (a,b,c,d) satisfies: a≠b≠c≠d,1≤a<b≤n,1≤c<d≤n,Aa<Ab,Ac>Ad,a≠b≠c≠d,1≤a<b≤n,1≤c<d≤n,Aa<Ab,Ac>Ada≠b≠c≠d,1≤a<b≤n,1≤c<d≤n,A_a<A_b,A_c>A_d,a≠b≠c≠d,1≤a原创 2017-09-03 09:17:22 · 278 阅读 · 0 评论 -
Infinite Inversions CodeForces - 540E (树状数组+离散化)
题目链接 题目大意,在一串无穷的1,2,3…n的串值,有k次操作,每次操作给出两个数a,b,即把坐标a和坐标b的值交换,问最后有多少个逆序对,0<=k<=105,a和b在int范围内0<=k<=10^5,a和b在int范围内 分析:问题的关键是,操作次数相对与整个序列是比较稀疏的,也就是说会有许多连续的数串 ,我们就是把这些连续的数串缩微一个点,而点的权值即为这个数串的数量,用离散化来处理,最后原创 2017-09-29 13:05:59 · 381 阅读 · 0 评论 -
Parity game POJ - 1733 (离散化+种类并查集)
Now and then you play the following game with your friend. Your friend writes down a sequence consisting of zeroes and ones. You choose a continuous subsequence (for example the subsequence from the t...原创 2018-04-04 17:40:00 · 189 阅读 · 0 评论 -
Coconuts HDU - 5925(二维离散化
TanBig, a friend of Mr. Frog, likes eating very much, so he always has dreams about eating. One day, TanBig dreams of a field of coconuts, and the field looks like a large chessboard which has R rows ...原创 2018-05-02 14:16:34 · 512 阅读 · 0 评论 -
Maximum Mode【Nowcoder多校训练第4场G题】(离散化+二分)
来源:牛客网题目描述 The mode of an integer sequence is the value that appears most often. Chiaki has n integersa1,a2,...,ana1,a2,...,an a_1,a_2,...,a_n. She woud like to delete exactly m of them such that:...原创 2018-07-28 16:59:06 · 246 阅读 · 0 评论