- 博客(10)
- 资源 (4)
- 收藏
- 关注
RSS订阅原创 2015 ACM/ICPC Asia Regional Beijing Online
时间限制:1000ms单点时限:1000ms内存限制:256MB描述You must have seen the very famous movie series,"Mission Impossible", from 1 to 4. And "Mission Impossible 5" is now on screen in China. Tom Cruis
2015-09-23 18:17:19
1006
原创 Regional Changchun Online--Elven Postman（裸排序二叉树）
Elven PostmanTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 880 Accepted Submission(s): 475Problem DescriptionElves are very peculia
2015-09-18 20:41:41
828
原创 Regional Changchun Online--Travel（最小生成树&& 并查集）
TravelTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1852 Accepted Submission(s): 641Problem DescriptionJack likes to travel a
2015-09-18 20:16:02
712
原创 Regional Changchun Online--Alisha’s Party
Alisha’s PartyTime Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1079 Accepted Submission(s): 297Problem DescriptionPrincess Alish
2015-09-15 21:56:05
699
原创 Regional Changchun Online--Ponds
网址：http://acm.hdu.edu.cn/showproblem.php?pid=5438PondsTime Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 376 Accepted Submission(s): 1
2015-09-13 20:50:25
890
原创 codeforce--Vasya and Petya's Game
网址：http://codeforces.com/contest/576/problem/AA. Vasya and Petya's Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutput
2015-09-11 20:45:57
1537
原创 Reflect
ReflectTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 288 Accepted Submission(s): 174Problem DescriptionWe send a light from o
2015-09-10 21:03:42
742
原创 BC水题--The Factor（质因分解）
网址：http://acm.hdu.edu.cn/showproblem.php?pid=5428roblem Description There is a sequence of n positive integers. Fancycoder is addicted to learn their product, but this product may be extremely
2015-09-09 20:32:37
956
原创 单源最短路径整理
1、单源Dijkstra#define MAX 1010#define INF 0x3f3f3f3fbool vis[MAX];int pre[MAX] ; ///记录到当前点的父节点，用来还原路径///注意开始输入的时候如果不能到达的应该初始化为INFvoid Dijkstra (int cost[][MAX] , int lowcost[],int n,int beg){
2015-09-02 21:55:05
1024
原创 图基础模板
1、判断割顶：对于根节点当然简单，当且仅当它有两个或者是更多的子节点时，他才是割顶。对于其他节点，定理：在无向图连通图G的DFS树中，非根节点u是G的割顶当且仅当u存在一个子节点v,使得v及其所有后代都没有反向边连回u的祖先#include #include #include #include #include #include #include #inclu
2015-09-02 19:58:51
753
Redis-x64-3.2.100.msi
2017-10-14
坦克大战游戏，支持声音，配置等
2015-03-14
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人