Mr_Treeeee的博客

City GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7184    Accepted Submission(s): 3120Problem DescriptionBob is a strateg

Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18711    Accepted Submission(s): 5592Problem Descrip

FunctionTime Limit: 7000/3500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2669    Accepted Submission(s): 922Problem DescriptionThe shorter, the

Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2570    Accepted Submission(s): 1262Problem DescriptionNow here

Feel GoodTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 15264 Accepted: 4216Case Time Limit: 1000MS Special JudgeDescriptionBill is develop

D. Driving Testtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp has just attempted to pass the dri

L3-002. 堆栈时间限制200 ms内存限制65536 kB代码长度限制8000 B判题程序Standard作者陈越大家都知道“堆栈”是一种“先进后出”的线性结构，基本操作有“入栈”（将新元素插入栈顶）和“出栈”（将栈顶元素的值返回并从堆栈中将其删除）。现请你实现一种特殊的堆栈，它多了一种操作叫“查中值”，即返回堆栈中所有元素的中值。对于N个元素，若N是偶数，则中值定义为第N/2个最小元；若N...

https://www.nowcoder.com/acm/contest/201/J题意：有m种括号，给你一个括号字符串，每次询问问你l到r合法不。 POINT：注意：([)]这样的括号匹配是不合法的。这样就很容易知道，每一个右括号如果能匹配，肯定是有唯一的左括号的。如果只有一种括号，我们怎么判断他合法的呢：遇左加入栈，遇右pop栈，如果栈空，则不合法。如果最后栈不...