Submission #63793465

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>
using namespace std;
using i64 = long long;
using u64 = unsigned long long;
void solve(){
    int n;
    unordered_map<int, int> cnt1, cnt2;
    i64 suml = 0, sumr = 0, ans = 0;
    cin>>n;
    vector<int> a(n);
    for(auto &i : a){
        cin>>i;
        if(cnt2[i] == 0){
            sumr++;
        }
        cnt2[i]++;
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
using u64 = unsigned long long;

void solve(){
    int n;
    unordered_map<int, int> cnt1, cnt2;
    i64 suml = 0, sumr = 0, ans = 0;
    cin>>n;

    vector<int> a(n);
    for(auto &i : a){
        cin>>i;
        if(cnt2[i] == 0){
            sumr++;
        }
        cnt2[i]++;
    }

    for(int i = 0; i < n; i++){
        cnt2[a[i]]--;
        if(cnt1[a[i]] == 0){
            suml++;
        }
        cnt1[a[i]]++;
        if(cnt2[a[i]] == 0){
            sumr--;
        }

        ans = max(suml + sumr, ans);
    }
    cout<<ans<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Submission Info

Judge Result