二分||三分
文章平均质量分 81
i-unique
擅长各种姿势划水
展开
-
POJ 2886 Who Gets the Most Candies?(反素数+数学推导+模拟+线段树||树状数组+二分)
N children are sitting in a circle to play a game.The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero integer on it in his/her hand. The game starts from the K-th child, who tells all the others the integer on原创 2017-08-09 17:33:47 · 401 阅读 · 0 评论 -
CodeForces125E MST Company(根限度为k的最小生成树+二分)
The MST (Meaningless State Team) company won another tender for an important state reform in Berland.There are n cities in Berland, some pairs of the cities are connected by roads. Each road has its price. One can move along any road in any direction. The原创 2017-09-03 15:25:37 · 853 阅读 · 0 评论 -
HDU 3717 Rescue(二分+技巧性模拟)【详解】
The princess is trapped in a magic place. In this place, there are N magic stones. In order to rescue the princess, you should destroy all the stones. The N stones are in a straight line. We number them as s1, s2, ... sn from left to right. Each stone has原创 2017-09-01 10:20:24 · 363 阅读 · 0 评论 -
HDU 1969 Pie(二分+模拟)
My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a number N of them, of various tastes and of various sizes. F of my friends are coming to my party and each of them gets a piece of pie. This should be one piece of on原创 2017-07-23 21:46:50 · 329 阅读 · 0 评论 -
HDU 4614 Vases and Flowers (二分查找+线段树区间更新)
Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try to put them in the vases, one flower in one vase. She randomly choose the vase A and try to put a flower in原创 2017-07-26 20:54:08 · 635 阅读 · 0 评论 -
HDU 1806 Frequent values(线段树+离散化+二分)
You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to that, you are given several queries consisting of indices i and j (1 ≤ i ≤ j ≤ n). For each query, determine the most frequent value among the integers ai , .原创 2017-07-30 16:46:47 · 362 阅读 · 0 评论 -
HDU 3714 Error Curves(三分+模拟)
Josephina is a clever girl and addicted to Machine Learning recently. She pays much attention to a method called Linear Discriminant Analysis, which has many interesting properties.In order to test the algorithm's efficiency, she collects many datasets. W原创 2017-08-01 15:22:02 · 341 阅读 · 0 评论 -
HDU 4288 Coder (技巧性暴力模拟+二分||线段树+离线操作)
In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become increasing popular since the advent of cheap and reliable computers. Many companies now employ a single coder to wr原创 2017-08-01 19:56:55 · 477 阅读 · 1 评论 -
HDU 2871 Memory Control(线段树区间合并+各种综合运用)【好题】
Memory units are numbered from 1 up to N. A sequence of memory units is called a memory block. The memory control system we consider now has four kinds of operations: 1. Reset Reset all memory units free. 2. New x Allocate a memory block consisted of原创 2017-08-02 20:36:34 · 533 阅读 · 0 评论 -
HDU 5493 Queue(树状数组+二分)
NN people numbered from 1 to NN are waiting in a bank for service. They all stand in a queue, but the queue never moves. It is lunch time now, so they decide to go out and have lunch first. When they get back, they don’t remember the exact order of the que原创 2017-09-12 21:32:43 · 320 阅读 · 0 评论