[算法竞赛入门经典]带宽 UVa 140 P309

题目都没写。。。

题目等转自 https://www.cnblogs.com/devymex/p/3264538.html

Time limit: 3.000 seconds
限时3.000秒

 

Problem
问题

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 v is 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:
给定一个图(V,E)，其中V为顶点的集合，E为边的集合，属于VxV。给定V中元素的一种排序，那么顶点v的带宽定义如下：在当前给定的排序中，与v距离最远的且与v有边相连的顶点与v的距离。给定排序的带宽定义为各顶点带宽的最大值。例如考虑如下图：

 

 

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.
对于给出的这两个排序，它们各结点的带宽分别是（按排序顺序）：6, 6, 1, 4, 1, 1, 6, 6，排序带宽为6，以及5, 3, 1, 4, 3, 5, 1, 4，排序带宽为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.
输入由一系列的图构成。每个图独占一行。一个仅包含“#”字符的一行输入标志整个输入文件结束。对于每个图的输入，都包含一系列由“;”隔开的记录。每个记录包含一个结点名（一个大写字母，范围是“A”到“Z”），接着是一个“:”，然后是一些该结点的邻居结点。图中不会包含超过8个结点。

 

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
#

https://github.com/aoapc-book/aoapc-bac2nd/blob/master/ch7/UVa140.cpp
// UVa140 Bandwidth
// Rujia Liu
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;

const int maxn = 10;
int id[256], letter[maxn];

int main() {
  char input[1000];
  while(scanf("%s", input) == 1 && input[0] != '#') {
    // 计算结点个数并给字母编号
    int n = 0;
    for(char ch = 'A'; ch <= 'Z'; ch++)
      if(strchr(input, ch) != NULL) {
        //统计给定图有多少个结点
        id[ch] = n++;
        letter[id[ch]] = ch;
      }

    // 处理输入
    int len = strlen(input), p = 0, q = 0;
    vector<int> u, v;
    for(;;) {
      while(p < len && input[p] != ':') p++;
      if(p == len) break;
      while(q < len && input[q] != ';') q++;
      for(int i = p+1; i < q; i++) {
        u.push_back(id[input[p-1]]);
        v.push_back(id[input[i]]);
      }
      p++; q++;
    }

    // 枚举全排列
    int P[maxn], bestP[maxn], pos[maxn], ans = n;
    for(int i = 0; i < n; i++) P[i] = i;
    do {
      for(int i = 0; i < n; i++) pos[P[i]] = i; // 每个字母的位置
      int bandwidth = 0;
      for(int i = 0; i < u.size(); i++)
        bandwidth = max(bandwidth, abs(pos[u[i]] - pos[v[i]])); // 计算带宽
      if(bandwidth < ans) {
        ans = bandwidth;
        memcpy(bestP, P, sizeof(P));
      }
    } while(next_permutation(P, P+n));

    // 输出
    for(int i = 0; i < n; i++) printf("%c ", letter[bestP[i]]);
    printf("-> %d\n", ans);
  }
  return 0;
}