mowayao的专栏

Super Mario Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2183    Accepted Submission(s): 1061 Problem Description Mario is world-fam

UVa 12715 Watching the Kangaroo(二分)

Coder Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3183    Accepted Submission(s): 1254 Problem Description 　　In mathematics a

Data Handler Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2455    Accepted Submission(s): 616 Problem Description 　　You are in

271. Book Pile time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output: standard There is a pile of N books on the table. Two types of operations are p

1306. Sequence Median Time limit: 1.0 second Memory limit: 1 MB Language limit: C, C++, Pascal Given a sequence of N nonnegative integers. Let's define the median of such sequence. If N is

湫湫系列故事——减肥记II Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 2395    Accepted Submission(s): 1018 Problem Description 　　虽然制定了减肥食谱，

Wow! Such Sequence! Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2793    Accepted Submission(s): 843 Problem Description Recent

Nice boat Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1455    Accepted Submission(s): 645 Problem Description There is an o

Oh My Holy FFF Time Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 606    Accepted Submission(s): 141 Problem Description N soldiers fr

Inversion Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 914    Accepted Submission(s): 380 Problem Description bobo has a seque

Clairewd’s message Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3228    Accepted Submission(s): 1248 Problem Description Clairew

Theme Section Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1098    Accepted Submission(s): 570 Problem Description It's time for

Count the string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4449    Accepted Submission(s): 2094 Problem Description It is wel

Ping pong Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1556   Accepted: 596 Description N(3<=N<=20000) ping pong players live along a west-east street(con

Problem Description You are given N positive integers, denoted as x0, x1 ... xN-1. Then give you some intervals [l, r]. For each interval, you need to find a number x to make as small as possible!

Problem Description When Mr. B, Mr. G and Mr. M were preparing for the 2012 ACM-ICPC World Final Contest, Mr. B had collected a large set of contest problems for their daily training. When they decid

Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 31111   Accepted: 12982 Description Given two strings a and b we define a*b to be their concate

Kth number Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4585    Accepted Submission(s): 1461 Problem Description Give you a sequenc

echo is a curious and clever girl, and she is addicted to the ants recently. She knows that the ants are divided into many levels depends on ability, also, she finds the number of each level will cha

Mr. Pote's shop sells beans now. He has N bags of beans in his warehouse, and he has numbered them with 1, 2, …, N according to their expired dates. The i-th bag contains Wi units of beans. For sellin

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

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

HDU 1754 Problem Description 很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。   Input 本题目包含多组测试，请处理到文件结束。 在每个测

Feel Good Time Limit: 10 Seconds      Memory Limit: 32768 KB      Special Judge Bill is developing a new mathematical theory for human emotions. His recent investigations are dedicated to studyi

The segment of numerical axis from 0 to 109 is painted into white color. After that some parts of this segment are painted into black, then some into white again and so on. In total there have been

两种做法：线段树和树状数组 TLE了几次= = 主要是cout #include #include #include using namespace std; const int maxn = 30000+10; const int maxm = 65535*3+1; int n,num[maxn],C[maxm]; inline int lowbit(int x){ re

Man Down Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1389    Accepted Submission(s): 481 Problem Description The Game “Man Down