CodeforcesRound#261(Div.2)D樹(shù)狀數(shù)組應(yīng)用_html/css
來(lái)源:懂視網(wǎng)
責(zé)編:小采
時(shí)間:2020-11-27 15:54:42
CodeforcesRound#261(Div.2)D樹(shù)狀數(shù)組應(yīng)用_html/css
CodeforcesRound#261(Div.2)D樹(shù)狀數(shù)組應(yīng)用_html/css_WEB-ITnose:看著題意:[1,i]中等于a[i]的個(gè)數(shù)要大于[,jn]中等于a[j]的個(gè)數(shù) 且i int n;int aa[1000000 + 55];int bb[1000000 + 55];int c[1000000 + 55];map mp;ll lowbit(ll x) { return x&(-x);}void add(int i,i
導(dǎo)讀CodeforcesRound#261(Div.2)D樹(shù)狀數(shù)組應(yīng)用_html/css_WEB-ITnose:看著題意:[1,i]中等于a[i]的個(gè)數(shù)要大于[,jn]中等于a[j]的個(gè)數(shù) 且i int n;int aa[1000000 + 55];int bb[1000000 + 55];int c[1000000 + 55];map mp;ll lowbit(ll x) { return x&(-x);}void add(int i,i

看著題意:[1,i]中等于a[i]的個(gè)數(shù)要大于[,jn]中等于a[j]的個(gè)數(shù) 且i
int n;int aa[1000000 + 55];int bb[1000000 + 55];int c[1000000 + 55];map mp;ll lowbit(ll x) { return x&(-x);}void add(int i,int val) { while(i <= n) { c[i] += val; i += lowbit(i); }}ll get_sum(int i) { ll sum = 0; while(i) { sum += c[i]; i -= lowbit(i); } return sum;}void init() { memset(c,0,sizeof(c)); memset(aa,0,sizeof(aa)); memset(bb,0,sizeof(bb)); mp.clear();}int main() { while(scanf("%d",&n) == 1) { init(); for(int i=1;i<=n;i++)scanf("%d",&aa[i]); for(int i=1;i<=n;i++) { mp[aa[i]]++; bb[i] = mp[aa[i]]; add(bb[i],1); } mp.clear(); ll ans = 0ll; for(int i=n;i>=1;i--) { add(bb[i],-1); mp[aa[i]]++; int tmp = mp[aa[i]]; ans += i - get_sum(tmp) - 1; } cout<
聲明:本網(wǎng)頁(yè)內(nèi)容旨在傳播知識(shí),若有侵權(quán)等問(wèn)題請(qǐng)及時(shí)與本網(wǎng)聯(lián)系,我們將在第一時(shí)間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com
CodeforcesRound#261(Div.2)D樹(shù)狀數(shù)組應(yīng)用_html/css
CodeforcesRound#261(Div.2)D樹(shù)狀數(shù)組應(yīng)用_html/css_WEB-ITnose:看著題意:[1,i]中等于a[i]的個(gè)數(shù)要大于[,jn]中等于a[j]的個(gè)數(shù) 且i int n;int aa[1000000 + 55];int bb[1000000 + 55];int c[1000000 + 55];map mp;ll lowbit(ll x) { return x&(-x);}void add(int i,i