【codevs1077】多源最短路
problemsolutioncodes//Floyd-wallshall模板#includeusingnamespacestd;intn,e[110][110];intmain(){ios::sync_with_std…
problemsolutioncodes//Floyd-wallshall模板#includeusingnamespacestd;intn,e[110][110];intmain(){ios::sync_with_std…
problemsolutioncodes//标程Dijkstra#include#include#includeusingnamespacestd;//Tintn=60,m,vis[1010];//Graphstruct…
problemsolutioncodes//动态维护大根堆,贪心减少入队元素个数#include#include#includeusingnamespacestd;constintmaxn=100010;intn,a[m…
problemsolutioncodes//MST-Kruskal-排序贪心+并查集//题中N=M,(M小于N^2的)稀疏图用邻接表。#include#includeusingnamespacestd;typedeflo…
problemsolutioncodes//MST-Prim-贪心-堆优化#include#include#includeusingnamespacestd;constintmaxn=110;//Graphinte[ma…
problemsolutioncodes#includeusingnamespacestd;intmain(){intn,k=1;cin>>n;//1.第n个数在第k条斜线上(前k条斜线的数的个数为等差数列)while(…
problemsolutioncodes#includeusingnamespacestd;intn,a[1010],t;intmain(){cin>>n;for(inti=1;i>x;if(!a[x]){a[x]++;…
problemsolutioncodes#includeusingnamespacestd;constintmaxn=1010;intf[maxn];intmain(){intn;cin>>n;for(inti=1;i
problem有n个小组,进行排队。当一个人来到队伍时,若队伍中有自己小组成员时,他就直接站到其后面如果没有,则站到队伍最后面,形成自己小组的第一个入队元素。出队列时,给出出队指令,输出出队成员号码。solution维护…
problem给你一个n个点m条边的无向图,求s到t的最短路。solutionSPFA模板codes#include#include#include#definemaxn2500+10#definemaxm6200+10…