hdu 4000 Fruit Ninja

最新推荐文章于 2017-08-15 14:24:37 发布

HQD因为有趣所以做题

最新推荐文章于 2017-08-15 14:24:37 发布

阅读量1k

点赞数

分类专栏： ACM_数据结构文章标签： tree

本文链接：https://blog.csdn.net/hqd_acm/article/details/6740881

版权

ACM_数据结构专栏收录该内容

105 篇文章 1 订阅

订阅专栏

小大中+小中大= ?

#include <cstdio>
#include <cstring>
const int MAXN = 100000 + 1234;
const int mod = 100000007;
int n;
long long tree[MAXN];
long long ans[MAXN];
int a[MAXN];
inline int Lowbit(int x)
{
    return x&(-x);
}
void Update(int x, long long val)
{
    for(int i = x; i > 0; i-=Lowbit(i))
    {
        tree[i]+=val;
        tree[i] %= mod;
    }
}
long long Getsum(int x)
{
    long long temp = 0;
    for(int i = x; i <= n; i+=Lowbit(i))  temp+= tree[i];
    temp %= mod;
    return temp;
}
void Update2(int x, long long val)
{
    for(int i = x; i <= n; i+=Lowbit(i))
    {
        tree[i]+=val;
        tree[i] %= mod;
    }
}
long long Getsum2(int x)
{
    long long temp = 0;
    for(int i = x; i > 0; i-=Lowbit(i))  temp+= tree[i];
    temp %= mod;
    return temp;
}
int main()
{
    int T,cas=1;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++)  scanf("%d", &a[i]);
        long long sum = 0;
        memset(tree, 0, sizeof(tree));
        for(int i = n; i >= 1; i--)
        {
            ans[i] = Getsum(a[i]);
            if(ans[i]  == 2) sum += 1;
            else
            {
                sum += (ans[i] - 1) * ans[i] / 2;
            }

            sum = sum % mod;
            Update(a[i], 1);
            //printf("sum=%d\n", sum);
        }

      // printf("sum=%d\n", sum);
        memset(tree, 0, sizeof(tree));
        long long sum2 = 0;
        for(int i = 1; i <= n; i++)
        {
            sum2 += ans[i] * Getsum2(a[i]);
            sum2 %= mod;
            Update2(a[i], 1);
            //printf("sum2=%d\n",sum2);
        }

        long long tans = ((sum - sum2) % mod + mod) % mod;
        printf("Case #%d: %I64d\n",cas++, tans);
    }
    return 0;
}