codeforces 977F Consecutive Subsequence （dp）

E. Cyclic Components

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an undirected graph consisting of $n$ vertices and $m$ edges. Your task is to find the number of connected components which are cycles.

Here are some definitions of graph theory.

An undirected graph consists of two sets: set of nodes (called vertices) and set of edges. Each edge connects a pair of vertices. All edges are bidirectional (i.e. if a vertex $a$ is connected with a vertex $b$, a vertex $b$ is also connected with a vertex $a$). An edge can't connect vertex with itself, there is at most one edge between a pair of vertices.

Two vertices $u$ and $v$ belong to the same connected component if and only if there is at least one path along edges connecting $u$ and $v$.

A connected component is a cycle if and only if its vertices can be reordered in such a way that:

• the first vertex is connected with the second vertex by an edge,
• the second vertex is connected with the third vertex by an edge,
• ...
• the last vertex is connected with the first vertex by an edge,
• all the described edges of a cycle are distinct.

A cycle doesn't contain any other edges except described above. By definition any cycle contains three or more vertices.

There are $6$ connected components, $2$ of them are cycles: $[7,10,16]$ and $[5,11,9,15]$.

Input

The first line contains two integer numbers $n$ and $m$ ($1\le n\le 2\cdot {10}^5$, $0\le m\le 2\cdot {10}^5$) — number of vertices and edges.

The following $m$ lines contains edges: edge $i$ is given as a pair of vertices $v_i$, $u_i$ ($1\le v_i,u_i\le n$, $u_i\ne v_i$). There is no multiple edges in the given graph, i.e. for each pair ($v_i,u_i$) there no other pairs ($v_i,u_i$) and ($u_i,v_i$) in the list of edges.

Output

Print one integer — the number of connected components which are also cycles.

Examples

input

Copy

5 4
1 2
3 4
5 4
3 5

output

Copy

1

input

Copy

17 15
1 8
1 12
5 11
11 9
9 15
15 5
4 13
3 13
4 3
10 16
7 10
16 7
14 3
14 4
17 6

output

Copy

2

Note

In the first example only component $[3,4,5]$ is also a cycle.

The illustration above corresponds to the second example.

一、原题地址

传送门

二、大致题意

    求最大连续上升子序列。

三、思路

    一维的dp，记录一下当前数在数组前有没有出现过比它小1的数。

四、代码

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
using namespace std;
const int inf=0x3f3f3f3f;


map<int ,int >dp;
int t[300005];
stack<int>s;
int main()
{
	int n;
	scanf("%d",&n);
	int ans=-inf;
	int maxx;
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&t[i]);
		dp[t[i]]=dp[t[i]-1]+1;
		if(dp[t[i]]>ans)
		{
			ans=dp[t[i]];
			maxx=t[i];
		}
	}
	printf("%d\n",ans);
	for(int i=n;i>=1;i--)
	{
		if(t[i]==maxx)
		{
			s.push(i);
			maxx--;
		}
	}
	for(int i=0;i<ans;i++)
	{
		if(i!=0)printf(" ");
		printf("%d",s.top());
		s.pop();
	}
	printf("\n");
	getchar();
	getchar();
}