제출 #1148484

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148484		SyedSohaib_123	Team Coding (EGOI24_teamcoding)	C++20	0 / 100	6 ms	9800 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define append push_back
#define int long long

const int N=4e5+10,LG=21;
int mod=998244353;

vector<pair<int,int>>g[N];
int dp[N],val[N],tree[N<<2];

int get(int l,int r,int s,int a,int b){
    if(r<a or l>b) return 0;
    if(a<=l and r<=b) return tree[s];int m=(l+r)>>1;
    return max(get(l,m,s*2,a,b),get(m+1,r,s*2+1,a,b));
}

void upd(int l,int r,int s,int a,int b){
    if(r<a or l>a) return;
    if(l==r){
        tree[s]=b;return;
    }
    int m=(l+r)>>1;
    upd(l,m,s*2,a,b);
    upd(m+1,r,s*2+1,a,b);
    tree[s]=max(tree[s*2],tree[s*2+1]);
}

void solve(int tst){
    int n;
    cin>>n;
    map<int,int>f;
    int ans=0;
    for(int i=1;i<=n;i++){
        int a;
        cin>>a;
        f[a]++;
        ans=max(ans,f[a]);
    }
    cout<<ans<<endl;
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    // cin >> t;
    for(int i=1;i<=t;i++)
        solve(i);
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 19
• Subtask 3: 0 / 27
• Subtask 4: 0 / 23
• Subtask 5: 0 / 19