Codeforces Round #338 (Div. 2) 615B Longtail Hedgehog(dp)

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.

Sample test(s)

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.

题目链接:点击打开链接

n个点, m条边, 问点数和分叉最大乘积是多少, 点数要求是递增序列.

主要是理解题意, 记录每个点的出度, 以及递推每个点的最长递增序列长度, 求一下最大乘积即可.

AC代码:

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "queue"
#include "stack"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
#include "list"
#include "string"
#include "cstdlib"
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 5;
int n, m, out[MAXN], dp[MAXN];
ll ans = 1;
struct node
{
	int u, v;
	/* data */
}a[MAXN];
bool cmp(node a, node b)
{
	return a.u < b.u;
}
int main(int argc, char const *argv[])
{
	scanf("%d%d", &n, &m);
	for(int i = 0; i < m; ++i) {
		scanf("%d%d", &a[i].u, &a[i].v);
		if(a[i].u > a[i].v) swap(a[i].u, a[i].v);
		out[a[i].u]++, out[a[i].v]++;
	}
	sort(a, a + m, cmp);
	for(int i = 0; i < m; ++i) {
		int x = a[i].u, y = a[i].v;
		dp[y] = max(dp[y], dp[x] + 1);
	}
	for(int i = n; i >= 1; --i)
		ans = max(ans, 1ll * (dp[i] + 1) * out[i]);
	printf("%lld\n", ans);
	return 0;
}