#include <iostream>
#include <cstdio>
#include <vector>
#include <limits>
#include <map>
using namespace std;

// uzumaki naruto
#define TRACE

#ifdef TRACE
#define dbgarr(a,n)   cerr << "["; for(int i = 0; i < n; ++i) cerr << a[i] << " ";cerr << "\b]\n";
#define dbg(args...)  {debug,args; cerr<<endl;}
#define pause()       cin.get();cin.get();

#else
#define dbgarr(a,n)
#define dbg(args...)
#define pause()
#endif

struct debugger {
    template<typename T> debugger& operator , (const T& v) {
        cerr<<v<<" "; return *this;
    }
} debug;

template <typename T1, typename T2>
inline ostream& operator << (ostream& os, const pair<T1, T2>& p) {
    return os << "(" << p.first << ", " << p.second << ")";
}

template<typename T>
inline ostream &operator << (ostream & os,const vector<T>& v) {
    bool first = true; os << "[";
    for (typename vector<T>::const_iterator ii = v.begin(); ii != v.end(); ++ii) {
        if(!first) os << ", ";
        os << *ii; first = false;
    }
    return os << "]";
}

template <typename T>
inline void fi(T *a)
{
    register char c=0;
    while (c<33) c=getchar_unlocked();
    *a=0;
    int tmp = 0;
    while (c>33)
    {
        if ( c == 45 ) tmp = 1;
        else *a=*a*10+c-'0';
        c=getchar_unlocked();
    }
    if ( tmp == 1 ) *a = 0-(*a);
}

#define fr first
#define se second
#define pb push_back

typedef long long LL;
typedef pair<int,int> pii;
typedef vector<int> vi;

const int NN = 250005;
const int MM = 50005;
const int SQ = 500;

// sqrt decomposition + 2D binary indexed tree
int inp[NN], seg[NN];
int st[SQ+5], en[SQ+5];
int t[SQ+5][MM], nodes = 1;
pii q[10005];

void update(int x,int y,int v){
    for(int i = x; i <= nodes; i += i&-i){
        for(int k = y; k < MM; k += k&-k)
            t[i][k] += v;
    }
}

int query(int x,int y){
    int ans = 0;
    for(int i = x; i > 0; i -= i&-i){
        for(int k = y; k > 0; k -= k&-k)
            ans += t[i][k];
    }
    return ans;
}

int query(int a,int b,int c,int d){
    int ans = query(c,d);
    ans -= query(a-1,d);
    ans -= query(c,b-1);
    ans += query(a-1,b-1);
    return ans;
}

int get(int i,int j,int x,int y,int n){
    if (i > j) return 0LL;
    if (x > y) swap(x,y);

    int ans = 0;
    int ss = seg[i];
    while(i < en[ss] and i <= j){
        if (inp[i] > x and inp[i] < y)
            ++ans;
        ++i;
    }

    if (i > j) return ans;
    int r1 = ss+1, r2 = seg[j]-1;
    if (r1 <= r2)
        ans += query(r1,x+1,r2,y-1);
    ss = seg[j];
    i = st[ss];
    while(i <= j){
        if (inp[i] > x and inp[i] < y)
            ++ans;
        ++i;
    }
    return ans;
}

void solve(){
    int n,m,mx = 0;
    fi(&n);
    for(int i = 0; i < n; ++i)
        fi(&inp[i]), mx = max(mx,inp[i]);

    fi(&m);
    for(int i = 0; i < m; ++i){
        fi(&q[i].fr),fi(&q[i].se), --q[i].fr;
        mx = max(mx,q[i].se);
    }

    LL inv_cnt = 0;
    for(int j = 0; j < n; ++nodes){
        st[nodes] = j;
        while(j < st[nodes]+SQ and j < n)
            seg[j++] = nodes;
        en[nodes] = j;
    }

    for(int i = 0; i < n; ++i){
        inv_cnt += (LL)query(nodes,inp[i]+1,nodes,mx);
        update(nodes,inp[i],1);
    }

    for(int i = 0; i < nodes; ++i){
        for(int k = st[i]; k < en[i]; ++k)
            update(i,inp[k],1);
    }

    for(int i = 0; i < m; ++i){
        int x = q[i].fr,y = q[i].se;
        int p = inp[x];
        if (y > p){
            inv_cnt -= (LL)get(0,x-1,p,y+1,n);
            inv_cnt += (LL)get(x+1,n-1,p-1,y,n);
        }
        if (y < p){
            inv_cnt += (LL)get(0,x-1,y,p+1,n);
            inv_cnt -= (LL)get(x+1,n-1,y-1,p,n);
        }

        if (y != p){
            update(seg[x],y,1);
            update(seg[x],p,-1);
            inp[x] = y;
        }
        printf("%lld\n",inv_cnt);
    }
}

int main()
{
    solve();
    return 0;
}