BestCoder Round #16 1001(hdu 5086)

Revenge of Segment Tree

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 504    Accepted Submission(s): 200

Problem Description

In computer science, a segment tree is a tree data structure for storing intervals, or segments. It allows querying which of the stored segments contain a given point. It is, in principle, a static structure; that is, its content cannot be modified once the structure is built. A similar data structure is the interval tree.
A segment tree for a set I of n intervals uses O(n log n) storage and can be built in O(n log n) time. Segment trees support searching for all the intervals that contain a query point in O(log n + k), k being the number of retrieved intervals or segments.
---Wikipedia

Today, Segment Tree takes revenge on you. As Segment Tree can answer the sum query of a interval sequence easily, your task is calculating the sum of the sum of all continuous sub-sequences of a given number sequence.

 

Input

The first line contains a single integer T, indicating the number of test cases. 

Each test case begins with an integer N, indicating the length of the sequence. Then N integer Ai follows, indicating the sequence.

[Technical Specification]
1. 1 <= T <= 10
2. 1 <= N <= 447 000
3. 0 <= Ai <= 1 000 000 000

 

Output

For each test case, output the answer mod 1 000 000 007.

 

Sample Input

  
  

   
   2
1
2
3
1 2 3
  
  

 

Sample Output

  
  

   
   2
20

   
   

    
    

     
     Hint
    
    
For the second test case, all continuous sub-sequences are [1], [2], [3], [1, 2], [2, 3] and [1, 2, 3]. So the sum of the sum of the sub-sequences is 1 + 2 + 3 + 3 + 5 + 6 = 20.
Huge input, faster I/O method is recommended. And as N is rather big, too straightforward algorithm (for example, O(N^2)) will lead Time Limit Exceeded.
And one more little helpful hint, be careful about the overflow of int.
   
   
   
    
  
  

 

题意：让你求n个数中，1,2,3....n个数连续起来的和，具体看下样例就知道了。

做法：找出规律，第i个数字的系数为(n-i)*(i+1)第一个从0开始计数。还有就是注意好mod。

#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include<map>
#include <algorithm>
#include<ctime>
#define esp 1e-6
#define LL unsigned long long
#define inf 0x0f0f0f0f
using namespace std;
__int64 Scan()
{
    __int64 res = 0, ch, flag = 0;

    if((ch = getchar()) == '-')             //判断正负
        flag = 1;

    else if(ch >= '0' && ch <= '9')           //得到完整的数
        res = ch - '0';
    while((ch = getchar()) >= '0' && ch <= '9' )
        res = res * 10 + ch - '0';

    return flag ? -res : res;
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        __int64 ans,n,i,a;
        ans=0;
        scanf("%I64d",&n);
        for(i=0;i<n;i++)
        {
            __int64 a1,b1;
            scanf("%I64d",&a);
           a1=(n-i)*(i+1);
           a1=a1%1000000007;
           b1=a1*a;
           b1=b1%1000000007;
           ans+=b1;
           ans=ans%1000000007;
        }
        printf("%I64d\n",ans);
    }
}

.