mowayao的专栏

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

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

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

Clairewd’s messageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3228    Accepted Submission(s): 1248Problem DescriptionClairew

InversionTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 914    Accepted Submission(s): 380Problem Descriptionbobo has a seque

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

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

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

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

1306. Sequence MedianTime limit: 1.0 secondMemory limit: 1 MBLanguage limit: C, C++, PascalGiven a sequence of N nonnegative integers. Let's define the median of such sequence. If N is

271. Book Piletime limit per test: 0.25 sec.memory limit per test: 65536 KBinput: standardoutput: standardThere is a pile of N books on the table. Two types of operations are p

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

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

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

Problem DescriptionYou 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!

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

两种做法：线段树和树状数组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

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

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

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

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

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

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

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

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

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 31111 Accepted: 12982DescriptionGiven two strings a and b we define a*b to be their concate

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

UVa 12715 Watching the Kangaroo(二分)