CodeForces 615B Longtail Hedgehog（长尾巴的刺猬） 动态规划

B. Longtail Hedgehog

time limit per test

 3 seconds

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

This Christmas Santa gave Masha a magic picture and a pencil. The picture consists of n points connected by m segments (they might cross in any way, that doesn't matter). No two segments connect the same pair of points, and no segment connects the point to itself. Masha wants to color some segments in order paint a hedgehog. In Mashas mind every hedgehog consists of a tail and some spines. She wants to paint the tail that satisfies the following conditions:

1. Only segments already presented on the picture can be painted;
2. The tail should be continuous, i.e. consists of some sequence of points, such that every two neighbouring points are connected by a colored segment;
3. The numbers of points from the beginning of the tail to the end should strictly increase.

Masha defines the length of the tail as the number of points in it. Also, she wants to paint some spines. To do so, Masha will paint all the segments, such that one of their ends is the endpoint of the tail. Masha defines the beauty of a hedgehog as the length of the tail multiplied by the number of spines. Masha wants to color the most beautiful hedgehog. Help her calculate what result she may hope to get.

Note that according to Masha's definition of a hedgehog, one segment may simultaneously serve as a spine and a part of the tail (she is a little girl after all). Take a look at the picture for further clarifications.

Input

First line of the input contains two integers n and m(2 ≤ n ≤ 100 000, 1 ≤ m ≤ 200 000) — the number of points and the number segments on the picture respectively.

Then follow m lines, each containing two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the numbers of points connected by corresponding segment. It's guaranteed that no two segments connect the same pair of points.

Output

Print the maximum possible value of the hedgehog's beauty.

Examples

input

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

output

9

input

4 6
1 2
1 3
1 4
2 3
2 4
3 4

output

12

Note

The picture below corresponds to the first sample. Segments that form the hedgehog are painted red. The tail consists of a sequence of points with numbers 1, 2 and 5. The following segments are spines: (2, 5), (3, 5) and (4, 5). Therefore, the beauty of the hedgehog is equal to 3·3 = 9.

实话说这道题当时确实没有理解啥意思。看样例的图解也是搞不懂，因为最近在看图论。所以想研究一下。当然这也是参考题解搞懂的题意。意思是每一个点都可以看作是一个Spine（刺，尾椎）。求得是哪一个点的Degree乘以属于该点的tail

数值最大。。首先用了一个Vector保存每一个点的邻接点，然后在更新DP数组的时候判断Vector中的点是否小于该Spine。。小于则相当于是给DP数组更新（+1）。最后需要遍历所有的节点，求得最大的ans值。。注意：不要忘了给Vector清空内存。。不然下次在调用会出错。

#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#define INF 0x3f3f3f3f
#define mem(a,b) memset(a,b,sizeof(a));
#define For(a,b) for(int i = a;i<b;i++)
#define LL long long
#define MAX_N 100010
#define VN 10
using namespace std;
vector<int> edge[MAX_N];
int dp[MAX_N];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        int u,v;
        for(int i = 0; i<m; i++)
        {
            scanf("%d%d",&u,&v);
            edge[u].push_back(v);
            edge[v].push_back(u);
        }
        mem(dp,0);
        for(int i = 1; i<=n; i++)
        {
            dp[i] = 1;
            for(int j = 0; j<edge[i].size(); j++)
            {
                if(edge[i][j] > i) continue;
                dp[i] = max(dp[i],dp[edge[i][j]] + 1);
            }
        }
        LL ans = 0;
        for(int i = 1; i<=n; i++)
        {
            ans = max(ans,(LL)dp[i] * edge[i].size());
        }
        printf("%lld\n",ans);
        for(int i = 1; i<=n; i++)
        {
            edge[i].clear();
        }
    }
    return 0;
}