[codeforces]14D

D. Two Paths
time limit per test : 2 seconds
memory limit per test : 64 megabytes

As you know, Bob’s brother lives in Flatland. In Flatland there are n cities, connected by $n-1$ two-way roads. The cities are numbered from $1$ to $n$. You can get from one city to another moving along the roads.

The «Two Paths» company, where Bob’s brother works, has won a tender to repair two paths in Flatland. A path is a sequence of different cities, connected sequentially by roads. The company is allowed to choose by itself the paths to repair. The only condition they have to meet is that the two paths shouldn’t cross (i.e. shouldn’t have common cities).

It is known that the profit, the «Two Paths» company will get, equals the product of the lengths of the two paths. Let’s consider the length of each road equals 1, and the length of a path equals the amount of roads in it. Find the maximum possible profit for the company.

###Input

The first line contains an integer $n(2\le n\le 200)$, where n is the amount of cities in the country. The following $n-1$ lines contain the information about the roads. Each line contains a pair of numbers of the cities, connected by the road $ai,bi(1\le ai,bi\le n)$.
###Output
Output the maximum possible profit.
###Examples
Input1

4
1 2
2 3
3 4

Output1

1

Input2

7
1 2
1 3
1 4
1 5
1 6
1 7

Output2

0

Input3

6
1 2
2 3
2 4
5 4
6 4

Output3

4

题意：
给你一棵树，问树上任意两条不相交的路径（没有公共点即不相交）的长度乘积最大为多少。

题解：
因为n<=200。枚举边将其删去，那么这个树就变成两棵树了，然后将两棵树上最长路径长度相乘的最大值求出来就好了。

#include<bits/stdc++.h>
#define INF 2e9
using namespace std;
int n,dis[204],ans,ne,h[204];
struct edge{
    int to,nt;
}e[40004];
bool vis[204];
queue<int>q;
int add(int u,int v){
    e[++ne].to=v;e[ne].nt=h[u];h[u]=ne;
    return 0;
}
int bfs(int st){
    int pos=st,res;
    for(int i=0;i<=201;i++)dis[i]=INF;
    dis[st]=0;
    q.push(st);
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=h[x];i;i=e[i].nt){
            if( vis[x]&&vis[e[i].to])continue;
            if( dis[e[i].to]>dis[x]+1){
                dis[e[i].to]=dis[x]+1;
                q.push(e[i].to);
            }
        }
    }
    for(int i=0;i<=201;i++)if(dis[i]!=INF&&dis[i]>dis[pos])pos=i;
    for(int i=0;i<=201;i++)dis[i]=INF;
    dis[pos]=0;res=pos;
    q.push(pos);
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=h[x];i;i=e[i].nt){
            if( vis[x]&&vis[e[i].to])continue;
            if( dis[e[i].to]>dis[x]+1){
                dis[e[i].to]=dis[x]+1;
                q.push(e[i].to);
            }
        }
    }
    for(int i=0;i<=201;i++)if(dis[i]!=INF&&dis[i]>dis[res])res=i;
    return dis[res];
}
int main(){
    ans=0;
    scanf("%d",&n);
    memset(vis,0,sizeof(vis));
    for(int i=1;i<n;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        add(u,v);add(v,u);
    }
    for(int i=1;i<=n;i++){
        for(int j=h[i];j;j=e[j].nt){
            vis[i]=1;vis[e[j].to]=1;
            ans=max(ans,bfs(i)*bfs(e[j].to));
            vis[i]=0;vis[e[j].to]=0;
        }
    }
    printf("%d\n",ans);
    return 0;
}