摘要： Beautiful Numbers Time Limit: 2000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Vitaly is a very weird man. He's 阅读全文

摘要： Bear and String Distance Time Limit: 1000MS Memory Limit: 262144KB 64bit IO Format: %I64d & %I64u Submit Status Description Limak is a little polar be 阅读全文

摘要： Edward, the emperor of the Marjar Empire, wants to build some bidirectional highways so that he can reach other cities from the capital as fast as pos 阅读全文

摘要： 跳跃游戏 给定一个非负整数数组，假定你的初始位置为数组第一个下标。 数组中的每个元素代表你在那个位置能够跳跃的最大长度。 请确认你是否能够跳跃到数组的最后一个下标。 例如： A = [2,3,1,1,4], return true. A = [3,2,1,0,4], return false. 格式 阅读全文

摘要： Candy There are NNN children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the foll 阅读全文

摘要： In a BG (dinner gathering) for ZJU ICPC team, the coaches wanted to count the number of people present at the BG. They did that by having the waitress 阅读全文

摘要： 转变一下思维， 求差值最大连续字段和, 因为最后结果只增不减; #include <iostream> #include <cstring> #include <algorithm> using namespace std; #define N 100000+100 typedef long lon 阅读全文

摘要： B. Vanya and Books time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output B. Vanya and Books tim 阅读全文

摘要： Segment Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1012 Accepted Submission(s): 368 Problem 阅读全文

摘要： 严格上升子序列个数; 阅读全文