模板
淡蓝色的狼
这个作者很懒,什么都没留下…
展开
-
最短路径 前向星模板
Dijkstra优先队列优化: #include<iostream> #include<algorithm> #include<cstring> #include<cstdio> #include<queue> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = ; int head[maxn], dis[maxn],原创 2017-08-06 20:34:00 · 377 阅读 · 0 评论 -
最小生成树模板 并查集
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn=5100000; int m,n,r,pre[maxn],sum; struct node { int u,v,w; }edge[maxn]; int cmp(node aa原创 2017-08-06 20:37:50 · 210 阅读 · 0 评论 -
poj 2117
Electricity Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5701 Accepted: 1864 DescriptionBlackouts and Dark Nights (also known as ACM++) is a company that provides electricity.原创 2017-10-27 21:55:28 · 502 阅读 · 0 评论 -
poj2942
Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 13670 Accepted: 4583 DescriptionBeing a knight is a very attractive career: searching for the Holy G原创 2017-10-28 22:10:45 · 270 阅读 · 0 评论 -
hdu4738
Caocao’s BridgesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5560 Accepted Submission(s): 1745Problem Description Caocao was defeated by原创 2017-10-29 11:27:58 · 383 阅读 · 0 评论 -
poj 3177 Redundant Paths
DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten App原创 2017-10-30 21:57:32 · 163 阅读 · 0 评论 -
km算法模板 hdu2255
这篇博客讲的很好http://www.cnblogs.com/wenruo/p/5264235.html#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn=1100; const int inf=0x3f3f3f3f; int g[m原创 2017-10-17 10:44:03 · 343 阅读 · 0 评论 -
离散化模板
//离散化方法一: #include<bits/stdc++.h> using namespace std; const int maxn=100000+100; int a[maxn],b[maxn],c[maxn]; int main () { int n,m=0; scanf("%d",&n); for(int i=1;i<=n;i++) ...原创 2018-03-25 22:15:18 · 161 阅读 · 0 评论