Grit_ICPC的博客

Truck History Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 21311   Accepted: 8277 Description Advanced Cargo Movement, Ltd. uses trucks of different types.

Highways Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 24872   Accepted: 11468 Description The island nation of Flatopia is perfectly flat. Unfortunately, Fl

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 44981   Accepted: 18449 Description Farmer John has been elected mayor of his town! One of his campaig

题目大意：裸的最大生成树 思路：就是和最小生成树相似，Map数组初始化为0，并且在建立生成树的时候要选去最大的边进入集合。 #include #include #include #include #define inf 0x3f3f3f3f using namespace std; int n; int Map[1010][1010],dis[1010]; bool vis[1

Constructing Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17875 Accepted Submission(s): 6799 Problem Description There are N vill

大意：在空间中给定球的坐标，和棋半径，问所以球之间都可达并且权值和最小（球之间有重合的部分）。思路：直接最小生成树。#include<map> #include<queue> #include<cmath> #include<cstdio> #include<stack> #include<iostream> #include<cstring> #include<algorithm> #define

大意：n个点m条边，问如果每个联通分支中最多有一个环，最后可以组成的最大的权值和是多少。思路：类似一颗生成树，是的话那么一定是最大生成树。那么怎么判断是不是会有环的形成呢？那么就可以用并查集判断了，所以直接用克鲁斯卡尔算法算最大生成树即可。概括起来有两种情况：1、两个端点在同一集合，那么判断是不是有环（标记数组判定），2.不在同一集合，如果两边都有环也不可以。#include<map> #inclu

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #define mod 31011 using namespace std; int n,m,cnt,tot,ans=1,sum; int fa[105]; struct edge{int x,y,v;}e[1005]; struct data{int