Rank of TetrisTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4958Accepted Submission(s): 1369Prob...
分类:
其他好文 时间:
2014-08-07 00:40:07
阅读次数:
234
Nested DollsTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2643Accepted Submission(s): 785Problem...
分类:
其他好文 时间:
2014-08-07 00:36:37
阅读次数:
223
Triangle LOVETime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2478Accepted Submission(s): 1011Probl...
分类:
其他好文 时间:
2014-08-07 00:34:37
阅读次数:
266
BillboardTime Limit: 20000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10594Accepted Submission(s): 4686Problem...
分类:
其他好文 时间:
2014-08-07 00:26:57
阅读次数:
274
前情提要:Oracle OpenWorld 2013中Larry Ellison爆料的Oracle新特性:Oracle In Memory Database Option1. 这个新特性将随着12.1.0.2发布;2. In memory database option不会取代TimesTen(以下...
分类:
数据库 时间:
2014-08-07 00:24:07
阅读次数:
311
数据结构实验之图论二:基于邻接表的广度优先搜索遍历
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
给定一个无向连通图,顶点编号从0到n-1,用广度优先搜索(BFS)遍历,输出从某个顶点出发的遍历序列。(同一个结点的同层邻接点,节点编号小的优先遍历)
输入
输入第一行为整数n...
分类:
其他好文 时间:
2014-08-06 23:10:12
阅读次数:
425
http://poj.org/problem?id=3281
Dining
Time Limit: 2000MS
Memory Limit: 65536K
Total Submissions: 9121
Accepted: 4199
Description
Cows are such finicky ea...
分类:
其他好文 时间:
2014-08-06 23:07:52
阅读次数:
292
Inversion
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 914 Accepted Submission(s): 380
Problem Description
bobo has a seque...
分类:
其他好文 时间:
2014-08-06 23:07:22
阅读次数:
294
敌兵布阵
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 43122 Accepted Submission(s): 18259
Problem Description
C国的死对头A国这段时间正在进行军事演...
分类:
其他好文 时间:
2014-08-06 22:59:42
阅读次数:
366
Paths on the treeTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 531Accepted Submission(s): 182P...
分类:
其他好文 时间:
2014-08-06 22:48:32
阅读次数:
302