她山之石，决不自弃

枚举高度时要二分，否则超时，当l和r的整数相同就可以终止了。需要特别注意切面可以在某些金字塔上面，因为这WA了好多次。#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<string>#include<map>#include<set>#include<

全排列递归式无重复元素的全排列有重复元素的全排列源码实现非递归式全排列递归式无重复元素的全排列  对于一个不含有重复字符的字符串4132其全排列的第一个字符分别是该字符串的每个字符，如1xxxx,2xxxx,3xxxx,4xxxx，那么对于剩下的部分(xxxx)又是一个全排列。伪代码如下：void print_permutation(序列A,集合S){ if(S为空) 输出序列A

最开始的起点ss和终点tt，一定要在cin之后就要map，否则如下数据 0 aaa bbb  因为n=0，如果没有map，s=name2ID[ss]和t=name2ID[tt]没有被赋值。在这里WA了n次，给跪了。#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>

建立超级源点和超级汇点，家是超级源点s=0，超级汇点t=所有城市最大值+1，超级源点到相连的城市的边权=想去的城市到超级汇点的边权=0。只需要求出超级源点到超级汇点的最短路即可。#include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<string>#includ

原文链接：http://blog.csdn.net/lanxuezaipiao/article/details/44341645目录目录正文标记公式行内公式块级公式上标和下标分数表示各种括号根号表示省略号矢量表示间隔空间希腊字母特殊字符关系运算符集合运算符对数运算符三角运算符微积分运算符逻辑运算符戴帽符号连线符号箭头符号几个例子其它特殊字

先用floyd求出每两点之间的最短路。一开始我用深搜计算最短哈密顿回路，毫无意外TLE了。 #include<iostream>#include<cstring>#include<cstdlib>#include<cstdio>#include<cmath>#include<string>#include<map>#include<set>#include<algorithm>#

每条路除了距离，还有了费用。这样在我们计算每个点的最小距离d[]和最小费用时，优先保证距离最小d[i]>d[x]+maps[x][i][0]，其次保证费用最小d[i]==d[x]+maps[x][i][0]&&cost[i]>cost[x]+maps[x][i][1]。#include#include#include#include#include#include#include

Bellman_Ford基本方法，和使用邻接表和队列的优化。由于没有负环而且最短路一定存在，所以不需要判负环那一步。#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL

指定起点和终点，用dijskal求最短路#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define OJ_DEBUG 0#define READ_FILE 0u

#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define OJ_DEBUG 0#define READ_FILE 0using namespace std;co

将所有边排序，从小到大枚举最小边，以这条边为开始找最小生成树（不一定包含所有点），根据find(a)和find(b)是否相等判断a到b是否有边，p[a]表示以a为起点指向能到达的点，即连通。#include#include#include#include#include#include#include#include#include#include#include#inc

将A-K的上下左右有出水口的标记为1，否则标记为0。在地图中根据两个方块的位置关系，判断出水口是否相接。扫描地图时，只需要判断当前方块和上边或者左边是否相接。#include#include#include#include#include#include#include#include#include#include#include#include#include#d

水题#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define OJ_DEBUG 0#define READ_FILE 0using namespace std

kruskal超时，看discuss说可以不超时。用prim险过，估计改数据了。#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define OJ_DEBUG 0#

裸的kruskal。#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define OJ_DEBUG 0#define READ_FILE 0using nam

注意n=0的情况#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define OJ_DEBUG 0#define READ_FILE 1using names

数据太坑爹了，数据范围很小，NN_MAX给大了会TLE，不知道为什么。注意不能有环，一个 结点不能有多个入度，有空树，还有森林的情况，1 1 0 0不是树，因为指向了自己。#include#include#include#include#include#include#include#include#include#include#include#include#i

这道题坑多，看数据。0 01 1 0 01 2 2 1 0 01 2 2 3 4 5 5 6 0 0YesYesNoNo#include#include#include#include#include#include#include#include#include#include#include#include#include#def

并查集基本题。#include#include#include#include#include#include#include#include#include#include#include#include#include#define LL long long#define OJ_DEBUG 0#define READ_FILE 0using namesp

备个份，后面用到再加题目M67大神的几句话讲解：http://www.matrix67.com/blog/archives/39二分图最大匹配问题匈牙利算法    研究了几个小时，终于明白了。说穿了，就是你从二分图中找出一条路径来，让路径的起点和终点都是还没有匹配过的点，并且路径经过的连线是一条没被匹配、一条已经匹配过，再下一条又没匹配这样交替地出现。找到这样的路径后，显然路径