【codeforce】403 Div.2 A Andryusha and Socks
2017-03-06 17:34
615 查看
A. Andryusha and Socks
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
Output
Input
Output
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.
code:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int x,n;int s[200001];
while(~scanf("%d",&n)){
int num=0,sum=0;
memset(s,0,sizeof(s));
for(int i=1;i<=2*n;i++){
scanf("%d",&x);
s[x]++;
if(s[x]==2)
num--;
else
num++;
sum=max(sum,num);
}
printf("%d\n",sum);
}
return 0;
}
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
code:
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int x,n;int s[200001];
while(~scanf("%d",&n)){
int num=0,sum=0;
memset(s,0,sizeof(s));
for(int i=1;i<=2*n;i++){
scanf("%d",&x);
s[x]++;
if(s[x]==2)
num--;
else
num++;
sum=max(sum,num);
}
printf("%d\n",sum);
}
return 0;
}
相关文章推荐
- Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) A. Andryusha and Socks
- Codeforces Round #403 (Div. 2) A. Andryusha and Socks(简单模拟)
- CodeForces 780A Andryusha and Socks【水题】
- Codeforces 782 Andryusha and Socks
- Codeforces 780A-Andryusha and Socks
- Andryusha and Socks vj
- CodeForce 460A :Vasya and Socks
- Andryusha and Socks
- Codeforce 403 D. Innokenty and a Football League
- A. Andryusha and Socks
- 【codeforces 782A】Andryusha and Socks
- Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) C Andryusha and Colored Balloons
- CF-Round#403 Div2 A. Andryusha and Socks
- AC日记——Andryusha and Socks Codeforces 780a
- Mishka and Divisors[CodeForces Round #365 Div.2]
- Codeforces div.2 B. The Child and Set
- Codeforces Round #457(Div.2)Problem D Jamie and To-do List(可持久化Trie树)
- Codeforce 453 C. Little Pony and Summer Sun Celebration
- Codeforces Round #458 Div.2 C. Travelling Salesman and Special Numbers
- cf#320 Div.2 Problem E Weakness and Poorness