1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T401,#include using namespace std; const int MX = 1e5+2, SQ = 317; struct info { int l, r, i; }; int a[MX], cnt[MX], cnt2[MX], ans[MX], cans; info qry[MX]; void add(int t) { cnt2[cnt[t]]--; cnt[t]++; cnt2[cnt[t]]++; if(cnt[t] > cans) cans = cnt[t]; } void remove(int t) { cnt2[cnt[t]]--; cnt[t]--; cnt2[cnt[t]]++; if(!cnt2[cans]) cans--; } int main() { ios::sync_with_stdio(0);cin.tie(0); int n; cin >> n; cnt2[0] = n; for(int i=1; i<=n; i++) { cin >> a[i]; } int q; cin >> q; for(int i=0; i> l >> r; qry[i] = {l, r, i}; } sort(qry, qry+q, [](info x, info y){ return (x.l / SQ == y.l / SQ) ? x.r < y.r : x.l < y.l; }); int l = 1, r = 0; for(int i=0; i qry[i].r) { remove(a[r]); r--; } while(l < qry[i].l) { remove(a[l]); l++; } while(l > qry[i].l) { l--; add(a[l]); } ans[qry[i].i] = cans; } for(int i=0; i

코드 #5040