HDOJ 2492 Ping pong

题意：给出一个数组，从该数组中任选三个元素组成单调序列，判断有多少种取法。

链接：http://acm.hdu.edu.cn/showproblem.php?pid=2492

思路：求出每个点左右两边比该值大的数的个数和比该值小的个数，用树状数组正向与反向两次统计，最后求和。

注意点：无

以下为AC代码：

Run ID	Submit Time	Judge Status	Pro.ID	Exe.Time	Exe.Memory	Code Len.	Language	Author
12618994	2014-12-30 22:50:13	Accepted	2492	312MS	3240K	2089 B	G++	luminous11

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;

int cnt[100005];
int num[100005];
int lmin[100005];
int lmax[100005];
int rmin[100005];
int rmax[100005];
int n;

void update ( int x, int k )
{
    for ( ; x <= 100005; x += ( x & -x ) )
        cnt[x] += k;
}

int query ( int x )
{
    int ans = 0;
    for ( ; x > 0; x -= ( x & -x ) )
        ans += cnt[x];
    return ans;
}

int main()
{
    ios::sync_with_stdio( false );
    int ncase;
    cin >> ncase;
    while ( ncase -- )
    {
        cin >> n;
        for ( int i = 1; i <= n; i ++ )
        {
            cin >> num[i];
        }
        memset ( cnt,  0, sizeof ( cnt  ) );
        memset ( lmin, 0, sizeof ( lmin ) );
        memset ( lmax, 0, sizeof ( lmax ) );
        memset ( rmin, 0, sizeof ( rmin ) );
        memset ( rmax, 0, sizeof ( rmax ) );
        for ( int i = 1; i <= n; i ++ )
        {
            lmin[i] = query ( num[i] );
            lmax[i] = i - 1 - query ( num[i] - 1 );
            update ( num[i], 1 );
        }
        memset ( cnt, 0, sizeof ( cnt ) );
        for ( int i = n; i >= 1; i -- )
        {
            rmin[i] = query ( num[i] );
            rmax[i] = n - i - query ( num[i] - 1 );
            update ( num[i], 1 );
        }
        long long ans = 0;
        for ( int i = 1; i <= n; i ++ )
        {
            ans += lmin[i] * rmax[i];
            ans += lmax[i] * rmin[i];
        }
        cout << ans << endl;
    }
    return 0;
}