wwwlps的博客

#include //邻接表的最小生成树#include #include #include #include #define INF 0x3f3f3f3fusing namespace std;int n,m;struct node{ int to,num;};vectorv[1010];int prim(){ node d; int visit[1

多次查询树上两点之间的距离。先预处理bfs，求出树根到各个点的距离和各个点的深度，同时更新f[maxn][20],f(x,k)表示x的2^k辈祖先f(x,0)就是x的父节点。对于任意k,[1,logn], f[x,k]=f[f[x,k-1],k-1]。求lca时，将x,y调整至同一深度，再逐步向上寻找。#include <iostream>#include <...

F. Graph Without Long Directed Pathstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a connected undirected graph c...

https://ac.nowcoder.com/acm/contest/221/K#include &lt;iostream&gt;#include &lt;cstring&gt;#include &lt;algorithm&gt;#include &lt;cmath&gt;#include &lt;cstdio&gt;#include &lt;map&gt;#include &...

我们设置dis[i][k]表示走到第i号点，免费经过了k条边的最短路。 对于我们当前找到的终点，尝试起点的状态去更新，不选择此条边免费的状态和选择此条边免费的状态，再将这两个状态压入队列去更新可以到达的其他状态。#include&lt;cstdio&gt;#include&lt;cstring&gt;#include&lt;iostream&gt;#include&lt;algori...

转文：https://www.cnblogs.com/d-e-v-i-l/p/5452441.html#include &lt;iostream&gt;#include &lt;cstring&gt;#include &lt;cstdio&gt;#include &lt;vector&gt;#include &lt;set&gt;#include &lt;map&gt;#incl...

#include#include#include#include#include#include#include#define maxn 1005#define INF 0x3f3f3f3fusing namespace std;typedef long long LL;bool book[maxn];int path[maxn],pathnum[maxn],sumvalu

#include#include#include#define LL long long#define INF 99999999#define maxn 1005using namespace std;int n,m,startv,endv;//点、边、起点，终点 struct Node{ int pos,c; friend bool operator <(Node a,No

#include #include #include #include #include #include #include #include #include #include #define INF 9999999using namespace std;int main(){ int n,m; while(cin>>n>>m) { int count1=0

#include <iostream>#include <cstring>#include <string>#include <cstdlib>#include <map>#include <vector>#include <cmath>#include <queue>#include...

#include #include #include #include #include #include #include #define INF 99999999using namespace std;struct node{ int to; int weight;}p;int main(){ vectorv[205];//邻接表的最短路算法 int boo

https://ac.nowcoder.com/acm/contest/945/D#include<iostream>#include<queue>#include<cstring>#include<algorithm>#define INF 0x3f3f3f3f//#define LL long longusing namespa...