那些年我们写过的三重循环----CodeForces 295B Greg and Graph 重温Floyd算法
Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge between them in both directions. Greg loves playing with the graph and now he has invented a new game:
- The game consists of n steps.
- On the i-th step Greg removes vertex number xi from the graph. As Greg removes a vertex, he also removes all the edges that go in and out of this vertex.
- Before executing each step, Greg wants to know the sum of lengths of the shortest paths between all pairs of the remaining vertices. The shortest path can go through any remaining vertex. In other words, if we assume that d(i, v, u) is the shortest path between vertices v and u in the graph that formed before deleting vertex xi, then Greg wants to know the value of the following sum: .
Help Greg, print the value of the required sum before each step.
The first line contains integer n (1 ≤ n ≤ 500) — the number of vertices in the graph.
Next n lines contain n integers each — the graph adjacency matrix: the j-th number in the i-th line aij(1 ≤ aij ≤ 105, aii = 0) represents the weight of the edge that goes from vertex i to vertex j.
The next line contains n distinct integers: x1, x2, ..., xn (1 ≤ xi ≤ n) — the vertices that Greg deletes.
Print n integers — the i-th number equals the required sum before the i-th step.
Please, do not use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use thecin, cout streams of the %I64d specifier.
1 0 1
0
2 0 5 4 0 1 2
9 0
4 0 3 1 1 6 0 400 1 2 4 0 1 1 1 1 0 4 1 2 3
17 23 404 0
题目链接:here
非常值得一做的经典题目,让我们再一次想起Floyd算法三重for循环背后的光芒。
#include<cstdio> #define N 505 #define ll long long int ll dp[N][N],arr[N],ans[N],n; ll _min(ll a,ll b) { return a<b?a:b; } int main() { while(scanf("%d",&n)!=EOF) { for(int i=0;i<n;i++) { for(int j=0;j<n;j++) scanf("%lld",&dp[i][j]); } for(int i=0;i<n;i++) scanf("%lld",&arr[n-i-1]); for(int i=0;i<n;i++) arr[i]--; for(int mid=0;mid<n;mid++) { int u=arr[mid]; ll temp=0; for(int e=0;e<n;e++) { for(int s=0;s<n;s++) { int a=arr[s]; int b=arr[e]; dp[a][b]=_min(dp[a][b],dp[a][u]+dp[u][b]); if(s<=mid && e<=mid) temp+=dp[a][b]; } } ans[n-mid-1]=temp; } for(int i=0;i<n;i++) printf("%I64d ",ans[i]); printf("\n"); } return 0; }
相关文章
- 【BZOJ4652】【NOI2016】循环之美(莫比乌斯反演,杜教筛)
- for循环和增强版的for循环
- JQ,js 滚动列表,JQ操作获取最后一个元素,并移动到内容标签头部无限循环
- 【高阶循环谱】基于FPGA的高阶循环谱的调制识别算法开发
- 雷电模拟器一键宏实现循环点击
- Python:for循环语句
- 循环冗余校验(CRC)算法入门引导
- AngularJS--day03-取数组数据循环不重复
- js跳出循环的三种方法
- 【2011年全国试题3】已知循环队列存储在一维数组A[0…n-1],且队列非空时,front和rear分别指向队头元素和队尾元素。若初始时队列
- Python——在for循环中更改list值的方法
- shell 脚本远程执行for循环的一些问题
- 从环境变量循环获取 - name: "discovery.zen.minimum_master_nodes" value: "2" 带点类型的环境变量然后再放入数组 最后执行命令作为参数 另一种env的处理方法是启动容器后执行脚本 声明新变量赋值环境变量的值 sed 替换变量到 配置文件
- robot:循环遍历数据库查询结果是否满足要求
- 打造适合自己的知识库,循环提纯知识并让自己受益
- sql server中的while循环语句
- 循环队列(Joseplus Problem)