摘要：
Factorial Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3748 Accepted Submission(s):... 阅读全文
posted @ 2017-01-24 18:29
junior19
阅读(154)
评论(0)
推荐(0)
摘要：
B. Checkout Assistant time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Bob ... 阅读全文
posted @ 2017-01-24 18:07
junior19
阅读(222)
评论(0)
推荐(0)
摘要：
Zero Escape Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1578 Accepted Submission... 阅读全文
posted @ 2017-01-24 00:51
junior19
阅读(197)
评论(0)
推荐(0)
摘要：
Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19924 Ac... 阅读全文
posted @ 2017-01-23 14:38
junior19
阅读(138)
评论(0)
推荐(0)
摘要：
TBATTLE - Thor vs Frost Giants #number-theory #sliding-window-1 Thor is caught up in a fierce battle with Loki's army. This army consists of ... 阅读全文
posted @ 2017-01-22 20:57
junior19
阅读(241)
评论(0)
推荐(0)
摘要：
# include # include # include # include using namespace std;struct node{ int key; node* parent; node* right; node* left;};//中序遍历，从小到大遍历，... 阅读全文
posted @ 2017-01-22 16:52
junior19
阅读(107)
评论(0)
推荐(0)
摘要：
题意：给定两个字符串，求一个最短的字符串使其中序列包含这两个字符串。 输出最短的长度和总的方案数。 题解： 由最长公共子序列方程转化而来： 最短长度 如果s[i]==t[j],len[i][j] = len[i-1][j-1] + 1， 否则len[i][j] = min(len[i][j... 阅读全文
posted @ 2017-01-21 15:35
junior19
阅读(103)
评论(0)
推荐(0)
摘要：
Advanced Fruits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3203 Accepted Submissi... 阅读全文
posted @ 2017-01-21 11:09
junior19
阅读(127)
评论(0)
推荐(0)
摘要：
1015. Letter-moving Game (35) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 CAO, Peng Here is a simple inters... 阅读全文
posted @ 2017-01-20 22:14
junior19
阅读(164)
评论(0)
推荐(0)
摘要：
All X Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1637 Accepted Submission(s): 713... 阅读全文
posted @ 2017-01-18 20:17
junior19
阅读(165)
评论(0)
推荐(0)
浙公网安备 33010602011771号