uva 10952 Rings'n'Ropes

最新推荐文章于 2018-08-25 16:04:40 发布

红鲤鱼遇绿鲤鱼

最新推荐文章于 2018-08-25 16:04:40 发布

阅读量461

点赞数

分类专栏：图论文章标签： uva floyed 图论

本文链接：https://blog.csdn.net/tengfei461807914/article/details/57078270

版权

图论专栏收录该内容

45 篇文章 0 订阅

订阅专栏

原题：
I have n tiny rings made of steel. I also have m pieces of rope, all of exactly the same length. The two ends of each piece of rope are tied to two different rings.
I am going to take one of the rings, L, into my left hand, and another ring, R into my right
hand. Then I will pull the whole structure apart as hard as I can. Some of the ropes will be streched horizontally because of this. Others will hang down or bend out of shape. If I want the number of horizontally stretched ropes to be as large as possible, which L and R should I pick? Assume that the stretching of ropes in negligible, they all have negligible thickness and are free to slide around the rings that they are tied to. The thickness and radius of each ring is negligible, too.
Input
The first line of input gives the number of cases, N. N test cases follow. Each one starts with two lines containing n (2 ≤ n ≤ 120) and m (0 ≤ m ≤ n(n − 1)/2). The next m lines will each contain a pair of different rings (integers in the range [0,n − 1]). Each pair of rings will be connected by at most one rope.
Output
For each test case, output the line containing ‘Case #x:’, followed by the largest number of ropes that I can stretch horizontally by picking a pair of rings, L and R.
Sample Input
4
2
1
0 1
3
3
0 1
1 2
2 0
6
6
0 1
0 5
1 3
5 4
3 2
4 2
6
7
0 1
0 5
1 3
1 4
5 4
3 2
4 2
Sample Output
Case #1: 1
Case #2: 1
Case #3: 6
Case #4: 7

中文：
给你n个戒指，用m个没有弹力的相同长度的绳子连接起来，现在左手拿起其中一个戒指，右手拿起另外一个戒指，向两侧使劲拉伸，能绷紧的绳子数是多少？

#include<bits/stdc++.h>
using namespace std;
int mat[121][121];
int n,m,t;
const int inf=999999;
void floyed()
{
    for(int k=0;k<n;k++)
    {
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
                mat[i][j]=min(mat[i][j],mat[i][k]+mat[k][j]);
        }
    }
}


int solve()
{
    int ans=0,res;
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            if(mat[i][j]!=inf)
            {
                vector<int> tmp;
                for(int k=0;k<n;k++)
                {
                    if(mat[i][j]==mat[i][k]+mat[k][j])
                        tmp.push_back(k);
                }
                res=0;
                for(int k=0;k<tmp.size();k++)
                {
                    for(int p=k+1;p<tmp.size();p++)
                    {
                        int a,b;
                        a=tmp[k];
                        b=tmp[p];
                        if(mat[a][b]==1&&mat[i][a]!=mat[i][b])
                            res++;
                    }
                }
                ans=max(ans,res);
            }
        }
    }
    return ans;
}

int main()
{
    int k=1;
    ios::sync_with_stdio(false);
    cin>>t;
    while(t--)
    {
        cin>>n>>m;
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                if(i==j)
                    mat[i][j]=0;
                else
                    mat[i][j]=inf;
        for(int i=1;i<=m;i++)
        {
            int a,b;
            cin>>a>>b;
            mat[a][b]=mat[b][a]=1;
        }
        floyed();
        int ans=solve();
        cout<<"Case #"<<k++<<": "<<ans<<endl;
    }
    return 0;
}