Advertisement
Rofyda_Elghadban1

Untitled

Sep 18th, 2023
801
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.59 KB | None | 0 0
  1.  #include <bits/stdc++.h>
  2.  
  3.  #define ll long long
  4.  #define ull unsigned long long
  5.  #define pi 3.141592654
  6.  #define NUM 1e18
  7.  #define Mod  1'000'000'007
  8.  #define fixed(n) fixed<<setprecision(n)
  9.  #define cin(v) for(auto &i:v) cin >> i ;
  10.  #define cout(v) for(auto &i:v) cout << i  <<" ";
  11.  #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
  12.  #define small(x) (x>=97&&x<=122)
  13.  #define capital(x) (x>=65&&x<=90)
  14.  #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
  15.  #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
  16.  #define all(v) ((v).begin()), ((v).end())
  17.  #define allr(v) ((v).rbegin()), ((v).rend())
  18.  #define updmax(a,b) a=max(a,b)
  19.  #define updmin(a,b) a=min(a,b)
  20.  #define ceil(a,b) ((a/b)+(a%b?1:0))
  21.  /* asc -> 1 2 3 ,des -> 3 2 1 */
  22.  
  23.  /***********************************************************************************/
  24.  
  25.  using namespace std;
  26.  
  27.  void Rofyda_Elghadban(){
  28.   #ifndef ONLINE_JUDGE  
  29.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  30.    #endif
  31.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  32.  }
  33.  
  34.  
  35.  void solve(){
  36.   int n,counter=0,maxi=INT_MIN;
  37.   cin>>n;
  38.   vector<int>v(2*n);
  39.   cin(v);
  40.   int freq[100001]{};
  41.   for(int i=0;i<2*n;i++){
  42.     freq[v[i]]++;
  43.     if(freq[v[i]]==1){
  44.       counter++;
  45.     }else if(freq[v[i]]>1){
  46.       freq[v[i]]--;
  47.       counter--;
  48.     }
  49.     maxi=max(maxi,counter);
  50.   }cout<<maxi<<"\n";
  51.  }
  52.  
  53.  
  54.  int main(){
  55.  Rofyda_Elghadban();
  56.  //freopen("input.txt","r",stdin);
  57.  //freopen("output.txt","r",stdout);
  58.   solve();
  59.  
  60.  
  61.  return 0;
  62. }
  63.  
  64.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement