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:T508,#include #include #include #include #include using namespace std; const int MX = 5e5+2, SQR = 707; int a[MX], ans[MX], cnt[MX]; struct info{ int l, r, i; } qry[MX]; int cur; void add(int t) { cnt[t]++; if(cnt[t] == 3) { cur--; } else if(cnt[t] == 2) { cur++; } } void sub(int t) { cnt[t]--; if(cnt[t] == 2) { cur++; } else if(cnt[t] == 1) { cur--; } } int main() { ios::sync_with_stdio(0);cin.tie(0); int n, q; cin >> n >> q; for(int i=1; i<=n; i++) cin >> a[i]; for(int i=0; i> qry[i].l >> qry[i].r; qry[i].i = i; } sort(qry, qry+q, [](auto a, auto b){ return make_pair(a.l/SQR, a.r) < make_pair(b.l/SQR, b.r); }); int l = 1, r = 0; for(int i=0; i ql) { l--; add(a[l]); } while(r > qr) { sub(a[r]); r--; } while(l < ql) { sub(a[l]); l++; } ans[qi] = cur; } for(int i=0; i

코드 #5136