CodeForces #187.div2.problem E

最新推荐文章于 2022-09-24 23:05:59 发布

GentleH

最新推荐文章于 2022-09-24 23:05:59 发布

阅读量582

点赞数

本文链接：https://blog.csdn.net/acbron/article/details/9061623

版权

Sereja has a sequence that consists of n positive integers, a₁, a₂, ..., a_n.

First Sereja took a piece of squared paper and wrote all distinct non-empty non-decreasing subsequences of sequence a. Then for each sequence written on the squared paper, Sereja wrote on a piece of lines paper all sequences that do not exceed it.

A sequence of positive integers x = x₁, x₂, ..., x_r doesn't exceed a sequence of positive integers y = y₁, y₂, ..., y_r, if the following inequation holds: x₁ ≤ y₁, x₂ ≤ y₂, ..., x_r ≤ y_r.

Now Sereja wonders, how many sequences are written on the lines piece of paper. Help Sereja, find the required quantity modulo1000000007 (10⁹ + 7).

Input

The first line contains integer n (1 ≤ n ≤ 10⁵). The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁶).

Output

In the single line print the answer to the problem modulo 1000000007 (10⁹ + 7).

Sample test(s)

input

1
42

output

input

3
1 2 2

output

input

5
1 2 3 4 5

output

题意：给出一组数列a[1],a[2],...,a[n]，找出所有不下降的且不相同的序列，比如（x<=y）a[x],a[x+1],...,a[y]满足a[x]<=a[x+1]<=...<=a[y]，对于所有的序列，求出比他小或者相等的序列的个数。其中小或者等的定义如题所述。例如样例2，(1,2,2)，满足题意的子序列有(1)-(2)-(1,2)-(2,2)-(1,2,2)，则答案有(1)-(1),(2)-(1,1),(1,2),(1,1),(1,2),(2,1),(2,2)-(1,1,1),(1,1,2),(1,2,2),(1,2,1)，为13。

首先，对于以数x结尾的序列，它的总数为(sum[1]+sum[2]+...+sum[x])*x+x，其中sum[i]表示以i结尾时的总数。比如序列(1,2,3)，满足的总数就为1*2*3(这是指子序列有3个元素时的总数)。至于为什么后面还有加上x，因为这要考虑到后续的问题，比如对于y=x+1，除了1*2*...*y（既1~y）的全部选上外，还有(2~y),(3~y)...(x~y)，所以根据公式，可以知道x*y(既子序列为(x,y))也就计算进去了。这里对于sum[1]+sum[2]+...+sum[x]，考虑到x最大有10^6，所以可以用树状数组求和。其中更新操作为：

update(x,(getSum(x)*x+x)%mod - ((getSum(x)-getSum(x-1)+mod)%mod+mod)%mod);中间过程的+mod是为了防止出现负数，其中getSum(x)*x+x即为上述公式，但是这里重复计算了之前加到x上的个数，故减掉。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define SIZE 1000001
#define mod 1000000007

using namespace std;

typedef __int64 Int;

Int sum[SIZE];

void update(int x,int add)
{
    for(int i=x; i<SIZE; i+=(i&(-i)))
        sum[i] = (sum[i] + add) % mod;
}

Int getSum(int x)
{
    Int ret = 0;
    for(int i=x; i>0; i-=(i&(-i)))
        ret = (ret + sum[i]) % mod;
    return ret;
}

int main()
{
    int n,tem;
    cin >> n;
    for(int i=1; i<=n; i++)
    {
        cin >> tem;
        Int all = getSum(tem);
        int add = ((all+1)*tem%mod - (all-getSum(tem-1)+mod)%mod + mod)%mod;
        update(tem,add);
    }
    cout << getSum(SIZE-1)%mod << endl;
}