Submission #63791294

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
 
#define int long long
 
#define vi vector<int>
#define vvi vector<vi>
#define endl '\n'
#define f(i,n) for(int i=0; i<n; i++)
#define rf(i,n) for(int i=n-1; i>=0; i--)
#define all(v) v.begin(),v.end()
#define mxe(v) *max_element(all(v))
#define mne(v) *min_element(all(v))
#define srt(v) sort(all(v))
#define Error(x...) { cout << "(" << #x << ")" << " = ( "; printIt(x); }
 
using namespace std;
 
void printv(vi v){ for(auto val: v) cout << val << ' '; cout << '\n';}
void prints(vector<string> v){ for(auto val: v) cout << val << ' '; cout << '\n';}
void solve(){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
 
#define int long long
 
#define vi vector<int>
#define vvi vector<vi>
#define endl '\n'
#define f(i,n) for(int i=0; i<n; i++)
#define rf(i,n) for(int i=n-1; i>=0; i--)
#define all(v) v.begin(),v.end()
#define mxe(v) *max_element(all(v))
#define mne(v) *min_element(all(v))
#define srt(v) sort(all(v))
#define Error(x...) { cout << "(" << #x << ")" << " = ( "; printIt(x); }
 
using namespace std;
 
void printv(vi v){ for(auto val: v) cout << val << ' '; cout << '\n';}
void prints(vector<string> v){ for(auto val: v) cout << val << ' '; cout << '\n';}

void solve(){
    int n;
    cin >> n;
    vi v (n);
    for(int &x: v)
    {
        cin>>x;
    }
    map<int, int> m1, m2;
    for(int x: v)   m2[x]++;

    int curr, res = 0;
    f(i, n)
    {
        if(m2[v[i]] == 1)   m2.erase(v[i]);
        else                m2[v[i]]--;
        m1[v[i]]++;
        res = max(res, (int)(m1.size() + m2.size()));
    }
    cout<<res<<endl;
}


int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    // cin >> t;
    while(t--) solve();
}

Submission Info

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:32:9: warning: unused variable ‘curr’ [-Wunused-variable]
   32 |     int curr, res = 0;
      |         ^~~~

Judge Result