欧拉回路 题目链接无向图 欧拉回路 所有点均为偶度顶点（顶点度数为偶数） 欧拉通路 最多仅2个点为奇度顶点（顶点度数为奇数） 有向图欧拉回路 所有点出度=入度欧拉通路 最多两个点出度!=入度；其中一个出度比入度大1；另一个入度比出度大1因此解决思路如下：连通图判定：并查集或者dfs均可顶点出入度：用degree[i]记录每个点的出入度结果，出则-1，入则+1，结果为0表示出入度...
用BFS 求最短路（较复杂） 题目链接#include<cstdio>#include<algorithm>#include<iostream>#include<string.h>#include<vector>#include<set>#include<cmath>#include<stack>#include&...
求一个图里任意两个点连接而成的最长的边 Problem K. Road NetworkProgram: batman.(cpp|java)Input: batman.inBalloon Color: Dark BlueAfter a ?erce battle with his opponent, Bruce Wayne ?nally won the elections and became the mayorof Gotham...
训练联盟补题 A ArchitectureYour brother has won an award at the recent Breakthroughs in Architectural Problems Con-ference and has been given the once in a lifetime opportunity of redesigning the city centerof ...
最小花费 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<set>#include<map>#include<...
凸多边形最优三角形剖分 区间DP 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<set>#include<map>#include<...
比较两个string型变量是相等时应该注意的问题 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<set>#include<map>#include<...
UVA 213信息解码 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<set>#include<map>#include<...
UVA 133 约瑟夫环变式 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<set>#include<map>#include<...
优先队列自定义优先级 struct node{ int a,b; friend bool operator < (node x,node y) { return x.a>y.a;//结构体中a小的优先级高 }};priority_queue<node>qu;
HDU 1495 bfs例题 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<set>#include<map>#include<...
HDU 2647（反向拓扑排序） 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<set>#include<map>#include<...
拓扑排序例题 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>#include<vector>#include<queue>using namespace std;#define m...
最小生成树例题 题目链接#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<cmath>using namespace std;#define maxn 10000005#define ll long long#define pi ...
关于最小质因子 题目链接所有不是质数的数的最小质因子是2或3或5或7。题解：1，如果n是素数，那么n-n=0执行一次减法。,2，如果n是合数，那么它的最小素因子要么是2要么3要么5要么7，再细分如果n是偶数则它的最小素因子是2，如果n是奇数，它的最小素因子是3/5/7，但无论如何此时的n减去它的最小素因子都是偶数，偶数的最小素因子是2，偶数减2还是偶数，所以对于这种情况只需找出n的最小素因子x，然后让n减去它...
查找至少含k个相同字母的子串 题目链接#include<cstdio>#include<algorithm>#include<iostream>#include<string.h>#include<vector>using namespace std;#define maxn 200005#define ll long longint ant[max...
求一个数的因子个数 ll cmp(ll n){ ll s=1; for(int i=2;i*i<=n;i++){ if(n%i==0){ int a=0; while(n%i==0){ n/=i; a++; } s=s*(...
前缀和例题 题目链接#include<cstdio>#include<algorithm>#include<iostream>#include<string.h>#include<vector>#include<cmath>using namespace std;#define maxn 100005#define ll...
dp简单例题 题目链接#include<cstdio>#include<algorithm>#include<iostream>#include<string.h>#include<vector>#include<cmath>using namespace std;#define maxn 100005#define ll...
UVA 10410 题意：给定一个树的BFS序和DFS序，求这棵树。思路：用栈维护。对应BFS序列映射出了每个节点和根节点的距离，遍历dfs序列，对当前节点和栈顶节点比较，如果该节点距离根节点更远，则记录后将节点放入栈中。否则弹掉栈顶元素继续比较。#include<cstdio>#include<algorithm>#include<iostream>#include&l...
关注
