HDU5086:Revenge of Segment Tree(规律题)
2014-11-02 19:52
330 查看
http://acm.hdu.edu.cn/showproblem.php?pid=5086
#include <iostream> #include <stdio.h> #include <math.h> #include <queue> #include <map> #include <stdlib.h> #include <algorithm> #include <string.h> #define mod 1000000007 using namespace std; int n; __int64 a[447010]; __int64 sum; int main() { int T; scanf("%d",&T); while(T--) { sum=0; scanf("%d",&n); a[0]=0; for(int i=1; i<=n; i++) { scanf("%I64d",&a[i]); } if(n==1) { printf("%I64d\n",a[1]); continue; } else { for(int i=1; i<=n; i++) { sum=(sum+a[i]*i%mod*(n-i+1)%mod)%mod; } } printf("%I64d\n",sum); } return 0; }
相关文章推荐
- HDU5086——Revenge of Segment Tree(BestCoder Round #16)
- HDOJ 5086 Revenge of Segment Tree 水题
- hdu5086——Revenge of Segment Tree
- Revenge of Segment Tree (hdu 5086)
- [HDU 5086] Revenge of Segment Tree (前缀和)
- RMQ_Sparse Table & Segment Tree
- ZJOI 2010 基站选址 DP+SegmentTree
- Senior Data Structure · 浅谈线段树(Segment Tree)
- [ACM] HDU 5086 Revenge of Segment Tree(所有连续区间的和)
- USTH-第三次测试-1004-Revenge of Segment Tree
- Lintcode: Segment Tree Query
- Stereo Matching文献笔记之(三):《Segment-Tree based Cost Aggregation for Stereo Matching》读后感~
- Data Structure: Segment Tree 线段树
- How to implement segment tree
- 线段树(segment tree)
- 《Segment-Tree based Cost Aggregation for Stereo Matching》读后感~
- lintcode-medium-Segment Tree Build II
- 线段树(segment tree)
- hdu1394Minimum Inversion Number_forces(segment_tree)
- BNUOJ39566 Do use segment tree (树链剖分+维护区间最大连续和)