CF961E Tufurama 树状数组

E. Tufurama

One day Polycarp decided to rewatch his absolute favourite episode of well-known TV series "Tufurama". He was pretty surprised when he got results only for season 7 episode 3 with his search query of "Watch Tufurama season 3 episode 7 online full hd free". This got Polycarp confused — what if he decides to rewatch the entire series someday and won't be able to find the right episodes to watch? Polycarp now wants to count the number of times he will be forced to search for an episode using some different method.

TV series have n seasons (numbered 1 through n), the i-th season has ai episodes (numbered 1 through ai). Polycarp thinks that if for some pair of integers x and y (x < y) exist both season x episode y and season y episode x then one of these search queries will include the wrong results. Help Polycarp to calculate the number of such pairs!

Input

The first line contains one integer n (1  ≤ n  ≤  2·10^5) — the number of seasons.

The second line contains n integers separated by space a1, a2, ..., an (1 ≤ ai ≤ 10^9) — number of episodes in each season.

Output

Print one integer — the number of pairs x and y (x < y) such that there exist both season x episode y and season y episode x.

 

题意：

有一部电视剧有n季，每一季有ai集。定义二元组(i,j)：存在第i季有第j集。求(i,j)与(j,i)同时合法(i<j)的对数。

真实题意就是：求<i,j>对数，使得a[i]≥j，a[j]≥i并且(i<j)

---

BIT做法

像很多其他题一样，对于这样的、关于元素大小关系之间的限制的题目，先排个序总是能够解决个一维限制掉去的。

我们使用一个结构体node x，x.i表示季数；x.a表示该季的集数。首先对x.a排序。那么就变成这个样子：

p[].a(j)　　3　　5　　1　　2
p[].i(i)　　1　　2　　3　　4
　　|
　　|
p[].a(j)　　1　　2　　3　　4 (取min之后)
p[].i(i)　　3　　4　　1　　2

先考虑每次的统计，那么只要ans+=query(a[i])就可以了。意思就是说ans加上1..a[i]季的贡献（其中每一季的贡献要么是0要么是1，但是由于之后会有修改，所以我们用BIT维护）

now用来更新那些已经 过气 没有贡献的答案，这里「没有贡献的答案」指的是p[now].a<i的情况，就是p[now]的电视剧集数太小了，已经不会再有贡献了，由于p[i].a是单增的，因此now++，扫一遍即可。

代码：

//#include"bits/stdc++.h"
#include<sstream>
#include<iomanip>
#include"cstdio"
#include"map"
#include"set"
#include"cmath"
#include"queue"
#include"vector"
#include"string"
#include"cstring"
#include"time.h"
#include"iostream"
#include"stdlib.h"
#include"algorithm"

#define db double
#define ll long long
#define vec vector<ll>
#define mt  vector<vec>
#define ci(x) scanf("%d",&x)
#define cd(x) scanf("%lf",&x)
#define cl(x) scanf("%lld",&x)
#define pi(x) printf("%d
",x)
#define pd(x) printf("%f
",x)
#define pl(x) printf("%lld
",x)
//#define rep(i, x, y) for(int i=x;i<=y;i++)
#define rep(i, n) for(int i=0;i<n;i++)
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int MOD = mod - 1;
const int inf = 0x3f3f3f3f;
const db PI = acos(-1.0);
const db eps = 1e-10;
using namespace std;
ll ans;
int n, now, a[N],bit[N];
struct node {
    int a, i;
    bool operator<(node &xx) const {
        return a < xx.a;
    }
} p[N];
int read() {
    char ch = getchar();
    int ret = 0;
    for (; !isdigit(ch); ch = getchar());
    for (; isdigit(ch); ch = getchar())
        ret = (ret << 3) + (ret << 1) + ch - 48;
    return ret;
}
void add(int x, int c) { for (; x <= n + 1; x += x & -x)bit[x] += c; }
int sum(int x) {
    int ret = 0;
    for (; x; x -= x & -x)
        ret += bit[x];
    return ret;
}
int main() {
    n = read();
    now = 1;
    for (int i = 1; i <= n; i++)
        a[i] = min(read(), n), p[i].a = a[i], p[i].i = i, add(i, 1);
    sort(p + 1, p + n + 1);
    for (int i = 1; i <= n; i++) {
        while (now <= n && p[now].a < i)add(p[now++].i, -1);//去掉无贡献的值
        ans += sum(a[i]);
        if (a[i] >= i) ans--;//(i,j) i=j的情况去掉
    }
    cout << ans / 2 << endl;
    return 0;
}