A. Andryusha and Socks
2017-03-10 20:30
211 查看
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.
解题说明:模拟题,可以用堆栈实现,也可以用简单的数组进行模拟。
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<iostream>
using namespace std;
int a[300000]={0};
int b[300000]={0};
int main()
{
int n;
int i,j,k,max=0,m=0;
scanf("%d",&n);
for(i=1;i<=2*n;i++)
{
scanf("%d",&a[i]);
b[a[i]]++;
if(b[a[i]]==0)
{
continue;
}
if(b[a[i]]==1)
{
m++;
}
if(b[a[i]]==2)
{
m--;
}
if(m>max)
{
max=m;
}
}
printf("%d\n",max);
return 0;
}
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.
解题说明:模拟题,可以用堆栈实现,也可以用简单的数组进行模拟。
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<iostream>
using namespace std;
int a[300000]={0};
int b[300000]={0};
int main()
{
int n;
int i,j,k,max=0,m=0;
scanf("%d",&n);
for(i=1;i<=2*n;i++)
{
scanf("%d",&a[i]);
b[a[i]]++;
if(b[a[i]]==0)
{
continue;
}
if(b[a[i]]==1)
{
m++;
}
if(b[a[i]]==2)
{
m--;
}
if(m>max)
{
max=m;
}
}
printf("%d\n",max);
return 0;
}
相关文章推荐
- Andryusha and Socks vj
- 【codeforces 782A】Andryusha and Socks
- AC日记——Andryusha and Socks Codeforces 780a
- Andryusha and Socks
- 【codeforce】403 Div.2 A Andryusha and Socks
- Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) A. Andryusha and Socks
- Codeforces 782 Andryusha and Socks
- Codeforces 780A-Andryusha and Socks
- Codeforces Round #403 (Div. 2) A. Andryusha and Socks(简单模拟)
- CodeForces 780A Andryusha and Socks【水题】
- CF-Round#403 Div2 A. Andryusha and Socks
- 460 A. Vasya and Socks
- 【Codeforces Round 262 (Div 2)A】【水题】Vasya and Socks 妈妈买袜子 最多穿几天
- C. Andryusha and Colored Balloons
- Codeforces Andryusha and Colored Balloons
- C. Andryusha and Colored Balloons
- A. Vasya and Socks
- #树上DFS# Codeforces Round #403 (Div. 2) C. Andryusha and Colored Balloons