CF-Round#403 Div2 A. Andryusha and Socks

最新推荐文章于 2018-02-05 18:34:02 发布

原创最新推荐文章于 2018-02-05 18:34:02 发布 · 623 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#ACM

ACM 专栏收录该内容

89 篇文章

订阅专栏

本文介绍了一个简单的算法，用于解决安德留沙如何整理他的成对袜子的问题。通过跟踪每双袜子的状态，该算法可以确定同时放置在桌子上的最大数量的单只袜子。

Andryusha is an orderly boy and likes to keep things in their place.

Today he faced a problem to put his socks in the wardrobe. He has n distinct pairs of socks which are initially in a bag. The pairs are numbered from 1 to n. Andryusha wants to put paired socks together and put them in the wardrobe. He takes the socks one by one from the bag, and for each sock he looks whether the pair of this sock has been already took out of the bag, or not. If not (that means the pair of this sock is still in the bag), he puts the current socks on the table in front of him. Otherwise, he puts both socks from the pair to the wardrobe.

Andryusha remembers the order in which he took the socks from the bag. Can you tell him what is the maximum number of socks that were on the table at the same time?

Input

The first line contains the single integer n (1 ≤ n ≤ 105) — the number of sock pairs.

The second line contains 2n integers x1, x2, ..., x2n (1 ≤ xi ≤ n), which describe the order in which Andryusha took the socks from the bag. More precisely, xi means that the i-th sock Andryusha took out was from pair xi.

It is guaranteed that Andryusha took exactly two socks of each pair.

Output

Print single integer — the maximum number of socks that were on the table at the same time.

Examples

input
1
1 1

output
1

input
3
2 1 1 3 2 3

output
2

Note

In the first example Andryusha took a sock from the first pair and put it on the table. Then he took the next sock which is from the first pair as well, so he immediately puts both socks to the wardrobe. Thus, at most one sock was on the table at the same time.

In the second example Andryusha behaved as follows:

Initially the table was empty, he took out a sock from pair 2 and put it on the table.
Sock (2) was on the table. Andryusha took out a sock from pair 1 and put it on the table.
Socks (1, 2) were on the table. Andryusha took out a sock from pair 1, and put this pair into the wardrobe.
Sock (2) was on the table. Andryusha took out a sock from pair 3 and put it on the table.
Socks (2, 3) were on the table. Andryusha took out a sock from pair 2, and put this pair into the wardrobe.
Sock (3) was on the table. Andryusha took out a sock from pair 3 and put this pair into the wardrobe.

Thus, at most two socks were on the table at the same time.

思路：

若输入的袜子在桌子上没有另一只，则放在桌子上，number+1；若桌子上存在另一只，则把这一双袜子放在衣柜里，number-1

代码如下：

#include<stdio.h>
#include<string.h>

#define maxn 100000+2
int a[maxn];
int main()
{
	memset(a, 0, sizeof(a));
	int n;
	while (scanf("%d", &n) != EOF)
	{
		int t = 2 * n;
		int num = 0, maxnum = 0;
		while (t--)
		{
			int x;
			scanf("%d", &x);
			if (a[x] == 0)
			{ 
				a[x]++; 
				num++;
				if (num > maxnum)maxnum = num;
			
			}
			else
			{
				a[x]--;
				num--;
			}
		}
		printf("%d\n",maxnum);
	
	}
	return 0;
}