Doraemon's Stone Game
Time Limit: 2 Seconds Memory Limit: 65536 KB
Doraemon is playing a game with Dorami. Initially there are piles of stones on the table. Each pile consists of at most ...
分类：
其他好文 时间：
2015-07-29 17:11:36
阅读次数：
97
1. specialty // @ (N-count) someone's specialty is a particular type of work that you do most, or a subject that they know a lot about @ (N-cou...
分类：
其他好文 时间：
2015-07-29 15:31:24
阅读次数：
99
Problem Definition:Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai).n vertical lines are drawn such ...
分类：
其他好文 时间：
2015-07-28 22:35:53
阅读次数：
111
Givennnon-negative integersa1,a2, ...,an, where each represents a point at coordinate (i,ai).nvertical lines are drawn such that the two endpoints of ...
分类：
其他好文 时间：
2015-07-28 20:26:35
阅读次数：
96
QueuesandPriority Queuesare data structures which are known to most computer scientists. TheTeam Queue, however, is not so well known, though it occur...
分类：
其他好文 时间：
2015-07-28 12:28:14
阅读次数：
103
Problem Description
Message queue is the basic fundamental of windows system. For each process, the system maintains a message queue. If something happens to this process, such as mouse click, text...
3.6 Write a program to sort a stack in ascending order (with biggest items on top). You may use at most one additional stack to hold items, but you ma...
分类：
编程语言 时间：
2015-07-27 07:04:04
阅读次数：
162
Data Structure ProblemTime Limit: 20 SecMemory Limit: 256 MB题目连接http://acm.uestc.edu.cn/#/problem/show/483DescriptionData structure is a fundamental c...
分类：
其他好文 时间：
2015-07-26 19:04:52
阅读次数：
110
题目：
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most k transactions.
Note:
Y...
分类：
编程语言 时间：
2015-07-26 15:56:12
阅读次数：
142
题目：
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transactions.
Note:
...
分类：
编程语言 时间：
2015-07-26 15:53:12
阅读次数：
155
