zoukankan      html  css  js  c++  java
  • CF #261 div2 D. Pashmak and Parmida's problem (树状数组版)

    Parmida is a clever girl and she wants to participate in Olympiads this year. Of course she wants her partner to be clever too (although he's not)! Parmida has prepared the following test problem for Pashmak.

    There is a sequence a that consists of n integers a1, a2, ..., an. Let's denote f(l, r, x) the number of indices k such that: l ≤ k ≤ r and ak = x. His task is to calculate the number of pairs of indicies i, j (1 ≤ i < j ≤ n) such that f(1, i, ai) > f(j, n, aj).

    Help Pashmak with the test.

    Input

    The first line of the input contains an integer n (1 ≤ n ≤ 106). The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 109).

    Output

    Print a single integer — the answer to the problem.

    Sample test(s)
    Input
    7
    1 2 1 1 2 2 1
    
    Output
    8
    
    Input
    3
    1 1 1
    
    Output
    1
    
    Input
    5
    1 2 3 4 5
    
    Output
    0



    树状数组写起来更方便。


    #include <iostream>
    #include <cstring>
    #include <cstdio>
    #include <cmath>
    #include <set>
    #include <stack>
    #include <cctype>
    #include <algorithm>
    #define lson o<<1, l, m
    #define rson o<<1|1, m+1, r
    using namespace std;
    typedef long long LL;
    const int mod = 99999997;
    const int MAX = 0x3f3f3f3f;
    const int maxn = 1000010;
    int n, a, b;
    int in[maxn], f[maxn], vis[maxn], l[maxn], r[maxn], tt[maxn];
    int c[maxn];
    int bs(int v, int x, int y) {
        while(x < y) {
            int m = (x+y) >> 1;
            if(in[m] >= v) y = m;
            else x = m+1;
        }
        return x;
    }
    int main()
    {
        cin >> n;
        for(int i = 0; i < n; i++) {
            scanf("%d", &in[i]);
            tt[i] = in[i];
        }
        sort(in, in+n);
        int m = unique(in, in+n) - in;
        for(int i = 0; i < n; i++) {
            f[i] = bs(tt[i], 0, m-1) + 1;
            vis[ f[i] ]++;
            l[i+1] = vis[ f[i] ];
        }
        memset(vis, 0, sizeof(vis));
        for(int i = n-1; i >= 0; i--) {
            f[i] = bs(tt[i], 0, m-1) + 1;
            vis[ f[i] ]++;
            r[i+1] = vis[ f[i] ];
        }
        LL sum = 0;
        for(int i = 1; i <= n; i++) {
            for(int j = r[i]+1; j <= maxn; j += j&-j) sum += c[j];
            for(int j = l[i]; j > 0; j -= j&-j) c[j]++;
        }
        cout << sum << endl;
        return 0;
    }


    
  • 相关阅读:
    第四周作业
    第三周作业
    第二周基础作业
    抓老鼠
    币值转换
    打印沙漏
    秋季学期学习总结
    2019春第七周作业
    2019春第六周作业 学习总结
    第五周作业总结以及学习总结
  • 原文地址:https://www.cnblogs.com/mfmdaoyou/p/6973784.html
Copyright © 2011-2022 走看看