刷题记录

problem 求min(maxval-minval) maxval,minval 生成树边的最大最小值 sort边集，枚举最小值 因为最小生成树同时也是最小瓶颈生成树 每次做一遍kruskal更新答案即可 code： #include<bits/stdc++.h> using namespace std; typedef long long ll; const int N=1e5+7...

题目 Sample Input ladder came tape soon leader acme RIDE lone Dreis peat ScAlE orb eye Rides dealer NotE derail LaCeS drIed noel dire Disk mace Rob dries # Sample Output Disk NotE derail drIed eye ladde...

题目 Problem Description: Do you like golf? I hate it. I hate golf so much that I decided to build the ultimate golf robot, a robot that will never miss a shot. I simply place it over the ball, choose t...

题目 kuangbin模板 #include<iostream> #include<string.h> #include<math.h> #include<stdio.h> #include<algorithm> #include<vector> using namespace std; const int N=1e5+7; ...