- 博客(63)
- 资源 (6)
- 收藏
- 关注
RSS订阅原创 最小生成树-Kruskal算法（模板）
Kruskal基本算法：每次选取最短的边，看该边相连的两点是否在同一集合内，若在，则跳过，若不在，就把两个点合并，判断与合并都用并查集实现。Kruskal的复杂度是O（ElogE），适合稀疏图。/*Kruskal算法求MST*/#include#include#include#include#includeusing namespace std;con
2016-08-25 10:49:07
4741
4
原创 POJ2458
HighwaysTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 28779Accepted: 13132DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately,
2016-08-25 10:37:46
672
原创 中南大学2016年校队选拔赛第二场Problem A
Problem A: 小Z的城市规划Time Limit: 3 Sec Memory Limit: 128 MBSubmit: 73 Solved: 8[Submit][Status][Web Board]Description市长小Z的城市在一场台风过后百废待应，现在有n个商场遭到了不同程度的破坏，此时这个城市有m个维修队伍等待施工，因为维修队伍水平不一，
2016-08-25 08:46:57
539
原创 POJ1258
Agri-NetTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 52488Accepted: 21880DescriptionFarmer John has been elected mayor of his town! One of his campa
2016-08-24 23:29:43
667
原创 最小生成树-Prim算法（模板）
/*Primq求MST耗费矩阵cost[][],标号从0开始，0~n-1返回最小生成树的权值，返回-1表示原图不连通*/#include#include#includeusing namespace std;const int INF=0x3f3f3f3f;const int MAXN=505;int cost[MAXN][MAXN];bool vis[MAXN];i
2016-08-24 23:19:13
613
原创 中南大学2016年校队选拔赛第二场Problem F
Problem F: 小z的远古讯息Time Limit: 10 Sec Memory Limit:128 MBSubmit: 147 Solved:32[Submit][Status][Ask]Description最新消息！长江中游地区发现人类（地球土著已灭绝）在原子时代留下的奇怪图像，根据现有研究留下奇怪图像的作者名叫小Z，这次发现将对地球土著的研究影响巨
2016-08-24 19:47:19
906
转载 POJ2823
Sliding WindowTime Limit: 12000MSMemory Limit: 65536KTotal Submissions: 54605Accepted: 15693Case Time Limit: 5000MSDescriptionAn array of size n ≤ 106 is
2016-08-24 19:28:33
319
原创 单源最短路SPFA（模板）
/*单源最短路SPFA时间复杂度O(kE)这个是队列实现，有时候改成栈实现会更加快，很容易修改这个复杂度是不定的*/#include#include#include#include#include#includeusing namespace std;const int MAXN=1010;const int INF=0x3f3f3f3f;struct Edge
2016-08-23 21:12:39
421
原创 中南大学2016年校队选拔赛第一场Problem D
Problem D: 小X的标题Time Limit: 1 Sec Memory Limit:128 MBSubmit: 70 Solved: 10[Submit][Status][Ask]Description小X梦中得到一个神秘字符串，醒来后他赶快记了下来。这个字符串大概是一篇晦涩难懂的文章，姑且不用去管他的含义，小X想给它起一个标题来表示这份天书。但是
2016-08-23 20:34:25
804
原创 中南大学2016年校队选拔赛第一场Problem A
Problem A: 小Z的黑白棋Time Limit: 1 Sec Memory Limit:128 MBSubmit: 18 Solved: 6[Submit][Status][Ask]Description小Z有一些黑白棋，他觉得黑白混杂在一起极具美感，所以他总喜欢将这些棋子排成一排序列S1，但是小Y就喜欢跟小Z作对，她会趁小Z不注意偷偷将小Z最右边的棋子拿走
2016-08-23 19:22:23
770
原创 中南大学2016年校队选拔赛第一场Problem E
Problem E: 小Y的彩色立方体Time Limit: 1 Sec Memory Limit:128 MBSubmit: 115 Solved: 18[Submit][Status][Ask]Description小Y十分喜欢给立方体染色，他有许多的立方体，他也有许多颜色的染料。他喜欢把立方体染成各种颜色。由于对于对称性的偏执的追求，他会把立方体的相对
2016-08-23 18:12:57
889
原创 单源最短路 bellman_ford算法（模板）
/*单源最短路bellman_ford算法，复杂度O(VE)可以处理负边权图。可以判断是否存在负环回路。返回true，当且仅当图中不包含从源点可达的负权回路vector E;先E.clear()初始化，然后加入所有边点的编号从1开始（从0开始简单修改就可以了）*/#include#include#include#includeusing namespace std;con
2016-08-22 21:19:49
546
原创 Dijkstra算法+堆优化（模板）
/*使用优先队列Dijkstra算法复杂度O(ElogE)注意对vector E[MAXN]进行初始化后加边*/#include#include#include#include#include#includeusing namespace std;const int INF=0x3f3f3f3f;const int MAXN=1000010;struct qnod
2016-08-22 20:01:45
3523
原创 Dijkstra单源最短路，邻接矩阵形式（模板）
/*单元最短路径，Dijkstra算法，邻接矩阵形式，复杂度为O(n^2)求出源beg到所有点的最短路径，传入图的顶点数和邻接矩阵cost[][]返回各点的最短路径lowcost[]，路径pre[],pre[i]记录beg到i路径上的父结点，pre[beg]=-1可以更改路径权类型，但权值必须为非负*/#include#include#include#includeusing
2016-08-22 19:34:50
833
原创 HDU4405
Aeroplane chessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3405 Accepted Submission(s): 2164Problem DescriptionHzz loves ae
2016-08-22 17:07:56
452
原创 HDU2602
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 52183 Accepted Submission(s): 21988Problem DescriptionMany years
2016-08-22 16:49:32
372
原创 HDU2955
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20905 Accepted Submission(s): 7757Problem DescriptionThe aspiring Roy
2016-08-22 16:40:30
348
原创 UVA12563
题意：n首歌，每首歌有其长度，还剩t秒，不包括678秒的《劲歌金曲》输出唱的总曲目和时间总长度紫书P274页题目传送门：UVA12563听学长讲，可以转化为0-1背包#include#include#include#includeusing namespace std;const int MAX = 10000;int main(){
2016-08-22 16:27:45
848
原创 POJ2533
Longest Ordered SubsequenceTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 47349Accepted: 21056DescriptionA numeric sequence of ai is ordered if a1 a
2016-08-22 16:19:57
320
原创 POJ1458
Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 48076Accepted: 19816DescriptionA subsequence of a given sequence is the given sequenc
2016-08-22 16:14:11
444
原创 SCU1114
D -数字三角Crawling in process...Crawling failedTime Limit:0MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmitStatus Practice SCU 1114 uDebugDescription
2016-08-22 16:09:54
477
原创 UVA12034
题意：n匹马比赛的所有可能结果总数题目传送门：UVA12034动态规划，dp[i][j]表示i匹马j个排名递推关系：dp[i][j]=(dp[i-1][j-1]+dp[i-1][j])%Mod*j%Mod;与前面的马同时到达+单独到达~注意取模的运算规则#include #include #include using namespace std;
2016-08-22 16:03:36
744
原创 UVA580
题意：一个栈中只能放U和L，3个U会爆炸，给出UL的总数，求会爆炸的个数。题目传送门：UVA580动态规划题，关键是赋予dp[i][j]一个特定的含义~~~dp[i][0]表示第i位由L结尾的安全总数dp[i][1],dp[i][2]分别表示第i位有一个U和两个U结尾的安全总数最后运用补集思想求出危险总数。递推关系：dp[i][0]=dp[i-1][0]+d
2016-08-22 15:53:27
443
原创 CSU1587
1587: 爬楼梯Time Limit: 1 Sec Memory Limit:128 MBSubmit: 587 Solved: 318[Submit][Status][Web Board]Description小时候我们都玩过爬楼梯的游戏：两人猜拳，赢了可向上爬一级，谁先到最高级则获胜。作为大学生，我们应该玩一个更有水平的游戏。现在一个人要上n级楼梯，每
2016-08-22 15:43:13
300
原创 CodeForces 501C
C. Misha and Foresttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's define a forest as a non-directed acyclic gr
2016-08-22 15:32:34
499
原创 CodeForces 621C
C. Wet Shark and Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n sharks who grow flowers for Wet
2016-08-22 15:24:38
382
原创 CodeForces 621B
B. Wet Shark and Bishopstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday, Wet Shark is given n bishops on a 1
2016-08-22 15:10:45
316
原创 CodeForces 685A
A. Robbers' watchtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRobbers, who attacked the Gerda's cab, are very suc
2016-08-22 14:20:24
305
原创 HDU1789
Doing Homework againTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11754 Accepted Submission(s): 6915Problem DescriptionIgnati
2016-08-22 14:03:14
342
原创 HDU4296
BuildingsTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3721 Accepted Submission(s): 1393Problem Description Have you ever he
2016-08-22 13:55:30
358
原创 HDU4864
D -TaskCrawling in process...Crawling failedTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice HDU 4864 uDebugDescript
2016-08-22 13:43:29
989
1
原创 CodeForces 681B
B. Economy Gametime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputKolya is developing an economy simulator game. His mos
2016-08-22 13:36:56
339
原创 CodeForces 691C
C. Exponential notationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a positive decimal number x.
2016-08-22 13:32:53
544
原创 CodeForces 697B
B. Barnicletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBarney is standing in a bar and starring at a pretty girl.
2016-08-22 13:29:55
484
原创 HDU4355
Party All the TimeTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5283 Accepted Submission(s): 1640Problem DescriptionIn the Da
2016-08-22 11:35:00
447
原创 HDU1597
find the nth digitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11884 Accepted Submission(s): 3572Problem Description假设：S1
2016-08-22 11:00:35
387
原创 CodeForces 687A
A. NP-Hard Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently, Pari and Arya did some research about NP
2016-08-22 10:48:48
361
原创 HDU2614
BeatTime Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1477 Accepted Submission(s): 870Problem DescriptionZty is a man that always
2016-08-22 10:41:15
336
原创 CodeForces 681C
C. Heap Operationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya has recently learned data structure named "Bi
2016-08-22 10:27:05
362
原创 HDU1242
RescueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27043 Accepted Submission(s): 9576Problem DescriptionAngel was caught by
2016-08-22 10:19:11
415
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人