Codeforces Round 338 (Div. 2)
B
Longtail Hedgehog
Codeforces
1600
原题
← AC →
翻译中…

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 $*u*_{*i*}$ and $*v*_{*i*}$ ($1 ≤ *u*_{*i*}, *v*_{*i*} ≤ *n*$, $*u*_{*i*} ≠ *v*_{*i*}$) — 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.

翻译中…

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$.

翻译中…

image

翻译中…

样例

Input #1
8 6
4 5
3 5
2 5
1 2
2 8
6 7
Output #1
9
InputCopy OutputCopy
Input #2
4 6
1 2
1 3
1 4
2 3
2 4
3 4
Output #2
12
InputCopy OutputCopy
题目信息
题号
615B
时间限制
3 s
内存限制
256 MB
标签
动态规划
图论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。