左眼皮跳跳

Problem DescriptionDuring the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels

Language:DefaultCount ColorTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 36180 Accepted: 10927DescriptionChosen Problem Solving and Program desi

Language:DefaultHotelTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 12417 Accepted: 5346DescriptionThe cows are journeying north to Thunder Bay i

Problem DescriptionThere 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, the

Language:DefaultBalanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 36833 Accepted: 17252Case Time Limit: 2000MSDescriptionFor th

Problem DescriptionThere is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate

Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segments of different colors you can see at last.

Problem DescriptionA lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Each of the battleships can be

Language:DefaultBalanced LineupTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 37122 Accepted: 17383Case Time Limit: 2000MSDescriptionFor th

Problem Description　　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

Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(1注意:本题的输入数据较多,推荐使用scanf读入数据. Output对于每组测试数据,请计算出被这些矩形覆盖过至少两次的区域的面积.结果保留两位小数. Sample Inpu

Problem DescriptionA number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Each rectangle can be partially

Language:DefaultTallest CowTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1964 Accepted: 906DescriptionFJ's N (1 ≤ N ≤ 10,000) cows conveniently

Language:DefaultBuy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 13847 Accepted: 6926DescriptionRailway tickets were difficult to buy ar

POJ 2777 线段树+位运算

HDU 1394 Minimum Inversion Number (线段树)

POJ 2182 Lost Cows（牛排序，线段树）

HDU 1754 I Hate It （线段树单点更新）

HDU 1698 Just a Hook (线段树区间更新）

HDU 2795 Billboard 贴广告（线段树）

HDU 1166 线段树

HDU 1541 Stars （线段树）

Problem DescriptionCorrupt governors always find ways to get dirty money. Paint something, then sell the worthless painting at a high price to someone who wants to bribe him/her on an auction, this

Frequent valuesTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13352 Accepted: 4913DescriptionYou are given a sequence of n integers a1 , a2 , ... , an 

Language:DefaultMayor's postersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 43702 Accepted: 12763DescriptionThe citizens of Bytetown, AB, could

MagicianTime Limit: 18000/9000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 150    Accepted Submission(s): 42Problem DescriptionFantasy magicians u