勿忘初衷

Mickey is assigned a task to help the puppies to escape by travelling from the south-west corner of a grid to the north-east corner undetected by the set of motion detectors deployed by Cruella. There

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

Connections in Galaxy WarTime Limit: 3 Seconds      Memory Limit: 32768 KBIn order to strengthen the defense ability, many stars in galaxy allied together and built many bidirectional tunnels

Galactic TravelTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %llu[Submit]   [Go Back]   [Status]  DescriptionProblem AGalactic Travel Input: Stan

class Node: def __init__(self, key): self.key = key self.left = self.right = None def equals(self, node): return self.key == node.keyclass SplayTree: def __init_

Problem K. KeksInput le: stdinOutput le: stdoutTime limit: 2 secondsMemory limit: 256 megabytesMirko and Slavko are bored at math class again so they came up with new game. Mirko writes do

Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5110    Accepted Submission(s): 1629Problem DescriptionRecogniz

Terrible SetsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 2778 Accepted: 1413DescriptionLet N be the set of all natural numbers {0 , 1 , 2 , . . . },

Moo University - Financial AidTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3708 Accepted: 1099DescriptionBessie noted that although humans have many un

D. Psychos in a Linetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n psychos standing in a line. Each psyc

D. Maximum Xor Secondarytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBike loves looking for the second maximum el

C. Cows and Sequencetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBessie and the cows are playing with sequences a

C. Greg and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGreg has an array a = a1, a2, ..., an andm operat

HHyper Prefix SetsPrefix goodness of a set string is length of longest common prefix*number of strings in the set. For example the prefix goodness of the set {000,001,0011} is 6.Yo

PotentiometersInput: Standard InputOutput: Standard OutputA potentiometer, or potmeter for short, is an electronic device with a variable electric resistance. It has two terminals and so

integers a1, a2...aN follow, indicating the skill rank of each player, in the order of west to east (1ai100000 , i = 1...N ).OutputFor each test case, output a single line contains an

Problem Description　　湫湫减肥　　越减越肥！　　　　最近，减肥失败的湫湫为发泄心中郁闷，在玩一个消灭免子的游戏。　　游戏规则很简单，用箭杀死免子即可。　　箭是一种消耗品，已知有M种不同类型的箭可以选择，并且每种箭都会对兔子造成伤害，对应的伤害值分别为Di（1 　　假设每种箭只能使用一次，每只免子也只能被射一次，请计算要消灭地图上的所有兔子最少需要的Q

Problem AAlmost Union-FindI hope you know the beautiful Union-Find structure. In this problem, you're to implement something similar, but not identical.The data structure you need to write is

开始以为要自己写最大最小堆，后来才知道set本身就是排好序的，囧。然后就是一直把end()当成了最后一个元素，错的离谱.所有删除的操作之前，都要记得判断是否为空，但因为这题保证了不会为空，所以不用判断

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4904    Accepted Submission(s): 2991Problem DescriptionT

Information SharingTime Limit: 3 Seconds      Memory Limit: 65536 KBThere is going to be a test in the kindergarten. Since the kids would cry if they get a low score in the test, the teacher h

BillboardTime Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4097    Accepted Submission(s): 1907Problem DescriptionAt the entrance

Buy TicketsTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 7802 Accepted: 3710DescriptionRailway tickets were difficult to buy around the Lunar New Ye

LCISTime Limit: 6000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1713    Accepted Submission(s): 748Problem DescriptionGiven n integers.You

Just a HookTime Limit : 4000/2000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 12   Accepted Submission(s) : 5Problem DescriptionIn the game of DotA,

A Simple Problem with IntegersTime Limit : 10000/5000ms (Java/Other)   Memory Limit : 262144/131072K (Java/Other)Total Submission(s) : 40   Accepted Submission(s) : 13Problem Description

More is betterTime Limit : 5000/1000ms (Java/Other)   Memory Limit : 327680/102400K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 6Font: Times New Roman | Verdana | Georgi

Max Sum of Max-K-sub-sequenceTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 4Font: Times New Roman | Ver

Non-negative Partial SumsTime Limit : 6000/3000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 1Font: Times New Roman | Verdana

I Hate ItTime Limit : 9000/3000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 6   Accepted Submission(s) : 2Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从

Hat’s WordsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 7   Accepted Submission(s) : 4Font: Times New Roman | Verdana | Georgia

Phone ListTime Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 4   Accepted Submission(s) : 3Font: Times New Roman | Verdana | GeorgiaF

#include #include #include using namespace std;int T;stack s[105];int main(){ int flag[105];//0 - up,1 - down int n,i,j; int pl,pr,p; int ans[105]; int outnum,out[105];