UVA - 140 Bandwidth
来源:互联网 发布:淘宝企业店铺避税提现 编辑:程序博客网 时间:2024/05/21 18:50
Bandwidth
Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then the bandwidth of a node vis defined as the maximum distance in the ordering between v and any node to which it is connected in the graph. The bandwidth of the ordering is then defined as the maximum of the individual bandwidths. For example, consider the following graph:
This can be ordered in many ways, two of which are illustrated below:
For these orderings, the bandwidths of the nodes (in order) are 6, 6, 1, 4, 1, 1, 6, 6 giving an ordering bandwidth of 6, and 5, 3, 1, 4, 3, 5, 1, 4 giving an ordering bandwidth of 5.
Write a program that will find the ordering of a graph that minimises the bandwidth.
Input
Input will consist of a series of graphs. Each graph will appear on a line by itself. The entire file will be terminated by a line consisting of a single#. For each graph, the input will consist of a series of records separated by `;'. Each record will consist of a node name (a single upper case character in the the range `A' to `Z'), followed by a `:' and at least one of its neighbours. The graph will contain no more than 8 nodes.
Output
Output will consist of one line for each graph, listing the ordering of the nodes followed by an arrow (->) and the bandwidth for that ordering. All items must be separated from their neighbours by exactly one space. If more than one ordering produces the same bandwidth, then choose the smallest in lexicographic ordering, that is the one that would appear first in an alphabetic listing.
Sample input
A:FB;B:GC;D:GC;F:AGH;E:HD#
Sample output
A B C F G D H E -> 3
#include <bits/stdc++.h>using namespace std;int cnt = 0;int perm[26], res[26];int dot[26], beg;int road[26][26];int Min, Max;int main(){ string line; while(getline(cin, line), line!="#") { memset(road, 0, sizeof(road)); memset(dot, 0, sizeof(dot)); for(size_t i = 0; i != line.size(); i++) { if(line[i]==':' || line[i]==';') continue; if(line[i+1]==':') beg = line[i] - 'A'; else{ road[beg][line[i]-'A'] = 1; road[line[i]-'A'][beg] = 1; } if(isalpha(line[i])) dot[line[i]-'A'] = 1; } cnt = 0; for(size_t i = 0; i < 26; i++) if(dot[i]) perm[cnt++] = i; sort(perm, perm+cnt); Min = INT_MAX; do{ Max = INT_MIN; for(int i = 0; i < cnt-1; i++) for(int j = i+1; j < cnt; j++) if(road[perm[i]][perm[j]]){ Max = max(Max, j-i); if(Max >= Min) goto loop; } if(Max < Min){ Min = Max; memcpy(res, perm, sizeof(perm)); } loop:; }while(next_permutation(perm, perm+cnt)); for(int i = 0; i < cnt; i++) printf("%c ", res[i]+'A'); printf("-> %d\n", Min); }}
- UVa 140 - Bandwidth
- uva 140 - Bandwidth
- UVa 140 - Bandwidth
- uva 140 - Bandwidth
- UVa 140 - Bandwidth
- UVA 140 - Bandwidth
- UVa 140 - Bandwidth
- UVA 140 Bandwidth
- uva 140 Bandwidth
- uva 140 Bandwidth
- UVa:140 Bandwidth
- UVa 140 - Bandwidth
- uva 140 - Bandwidth
- UVa 140 Bandwidth
- UVa 140 - Bandwidth
- uva 140 Bandwidth 带宽
- UVA - 140 Bandwidth
- UVA - 140 Bandwidth
- view controller的automaticallyAdjustsScrollViewInsets属性
- 一个人的价值取决于所在的位置
- Ambari集成Hadoop安装
- 关于卡尔曼滤波和粒子滤波最直白的解释
- mysql阅读查询执行计划的简要说明
- UVA - 140 Bandwidth
- linux 分割的文件在windows上合并
- android 打开数据库工具
- 第16周项目2.4 统计句子str中单词的个数 用指针做形参
- android-ActivityGroup
- Unity3D图像后处理特效——Fisheye image effect
- webapi的跨域问题
- 根据官网构建Scala的Rest服务
- 从12306.cn谈大网站架构与性能优化