A10776 | Andryusha and Socks
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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?
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?
输入格式
The first line contains the single integer $n$ ( $1<=n<=10^{5}$ ) — the number of sock pairs.
The second line contains $2n$ integers $x_{1},x_{2},...,x_{2n}$ ( $1<=x_{i}<=n$ ), which describe the order in which Andryusha took the socks from the bag. More precisely, $x_{i}$ means that the $i$ -th sock Andryusha took out was from pair $x_{i}$ .
It is guaranteed that Andryusha took exactly two socks of each pair.
The second line contains $2n$ integers $x_{1},x_{2},...,x_{2n}$ ( $1<=x_{i}<=n$ ), which describe the order in which Andryusha took the socks from the bag. More precisely, $x_{i}$ means that the $i$ -th sock Andryusha took out was from pair $x_{i}$ .
It is guaranteed that Andryusha took exactly two socks of each pair.
输出格式
Print single integer — the maximum number of socks that were on the table at the same time.
输入输出样例
输入 #1
1 1 1
输出 #1
1
输入 #2
3 2 1 1 3 2 3
输出 #2
2
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.
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted