Codeforces Round #266 (Div. 2)C(算是简单计数吧)
来源:互联网 发布:淘宝卖大米的营销策略 编辑:程序博客网 时间:2024/04/30 15:42
C. Number of Ways
time limit per test
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputYou've got array a[1], a[2], ..., a[n], consisting of n integers. Count the number of ways to split all the elements of the array into three contiguous parts so that the sum of elements in each part is the same.
More formally, you need to find the number of such pairs of indices i, j (2 ≤ i ≤ j ≤ n - 1), that .
Input
The first line contains integer n (1 ≤ n ≤ 5·105), showing how many numbers are in the array. The second line contains n integers a[1],a[2], ..., a[n] (|a[i]| ≤ 109) — the elements of array a.
Output
Print a single integer — the number of ways to split the array into three parts with the same sum.
Sample test(s)
input
51 2 3 0 3
output
2
input
40 1 -1 0
output
1
input
24 1
output
0
题意:RT
思路:一看代码就懂了,很短
0 0
- Codeforces Round #266 (Div. 2)C(算是简单计数吧)
- Codeforces Round #313 (Div. 2) C Gerald's Hexagon 计数
- Codeforces Round #266 (Div. 2) C
- Codeforces Round #266 (Div. 2) B & C
- Codeforces Round #266 (Div. 2)-C,D
- Codeforces Round #266 (Div. 2) C
- Codeforces Round #287 (Div. 2) C
- Codeforces Round #291 (Div. 2)(C)
- Codeforces Round #271 (Div. 2) C 简单几何
- 【Codeforces Round 367 (Div 2) C】【简单DP】Hard problem
- Codeforces Round #402 (Div. 2) C. Dishonest Sellers 简单模拟
- Codeforces Round #349 (Div. 1) C E (计数. SAM+线段树)
- 【codeforces】Codeforces Round #370 (Div. 2) C
- Codeforces Round #239 (Div. 2) C. Triangle(简单数学+暴力)
- Codeforces Round #169 (Div. 2)---C. Little Girl and Maximum Sum(简单贪心)
- Codeforces Round #341 (Div. 2) C. Wet Shark and Flowers(简单容斥)
- Codeforces Round #363 (Div. 2) C. Vacations(简单动态规划)
- Codeforces Round #379 (Div. 2) -- C. Anton and Making Potions(简单的分类讨论 + 二分)
- Codeforces Round #266 (Div. 2)E(判断父子关系+离线)
- 面试总结:用Java搞定面试中的链表题目
- 第一记
- IOS多线程编程之NSOperation和NSOperationQueue的使用
- libsvm在python下的使用及用绘制ROC曲线
- Codeforces Round #266 (Div. 2)C(算是简单计数吧)
- ConCurrentMap的分析和思考 .
- Word中小论文插入自传内容
- 怎么发邮件,javaMail
- IOS多线程编程之Grand Central Dispatch(GCD)介绍和使用
- zx的数 swun1698
- 如何选择工业相机
- HDU 1281 棋盘游戏
- eclipse GIT使用