zoukankan      html  css  js  c++  java
  • Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) A. Andryusha and Socks

     地址:http://codeforces.com/contest/782/problem/A

    题目:

    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
    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.

     思路: 水题,思路见代码。

     1 #include <bits/stdc++.h>
     2 
     3 using namespace std;
     4 
     5 #define MP make_pair
     6 #define PB push_back
     7 typedef long long LL;
     8 typedef pair<int,int> PII;
     9 const double eps=1e-6;
    10 const double pi=acos(-1.0);
    11 const int K=1e5+7;
    12 const int mod=1e9+7;
    13 
    14 int n,ans,vis[K];
    15 
    16 int main(void)
    17 {
    18     cin>>n;
    19     for(int i=1,x,cur=0;i<=2*n;i++)
    20     {
    21         cin>>x;
    22         if(vis[x])  cur--;
    23         else    vis[x]=1,ans=max(ans,++cur);
    24     }
    25     cout<<ans<<endl;
    26     return 0;
    27 }

     

     

  • 相关阅读:
    idea快捷键
    cas的缺点
    mybatis plus 实现逻辑删除
    mybatis plus的条件查询
    POI写非常大的数据量时
    POI中HSSF和XSSF
    JMM是什么
    Android面试收集录10 LruCache原理解析
    Android面试收集录9 IntentService详解
    Android面试收集录8 HandlerThread详解
  • 原文地址:https://www.cnblogs.com/weeping/p/6516418.html
Copyright © 2011-2022 走看看