
图
qdu_ellery
我有梦想啊!
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
C. 小花梨判连通(图的搜索)(map)
Description 小花梨给出原创 2019-05-20 10:23:18 · 144 阅读 · 0 评论 -
2017第八届蓝桥杯决赛 发现环(伪*拓扑排序)(蓝桥模板)(输出环)
#include<iostream> #include<vector> #include<queue> using namespace std; typedef long long LL; const int N=1e5+10; vector<int> G[N]; queue<int> q; bool vis[N]; int du[N];...原创 2019-05-11 20:31:35 · 217 阅读 · 0 评论 -
树的直径模板(dfs)(bfs)
POJ - 3310 Caterpillar An undirected graph is called a caterpillar if it is connected, has no cycles, and there is a path in the graph where every node is either on this path or a neighbor of a node o...原创 2019-08-02 12:13:19 · 431 阅读 · 0 评论 -
HDU 2196 Computer(树形dp)
A school bought the first computer some time ago(so this computer’s id is 1). During the recent years the school bought N-1 new computers. Each new computer was connected to one of settled earlier. Ma...原创 2019-08-13 21:54:35 · 203 阅读 · 4 评论 -
poj 1860 Currency Exchange(链式前向星的spfa模板)
Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can...原创 2019-08-11 16:32:42 · 135 阅读 · 0 评论 -
spfa(long long)标准模板
#include #include<stdio.h> #include #include #include<string.h> using namespace std; typedef long long ll; int n,m,s; #define maxn 605 ll edge[maxn]; int tot,head[maxn]; int vis[maxn],ver[...原创 2019-09-01 18:38:10 · 113 阅读 · 0 评论 -
2018 宁夏邀请赛 Moving On Gym - 102222F(深入理解三维floyd)
Firdaws and Fatinah are living in a country with n cities, numbered from 1 to n . Each city has a risk of kidnapping or robbery. Firdaws’s home locates in the city u , and Fatinah’s home locates in th...原创 2019-09-01 21:01:01 · 228 阅读 · 0 评论