C. Number of Ways

 http://codeforces.com/problemset/problem/466/C

题意：把数组分成三组连续的序列，每个序列总和相等；

思路：和为0特判。扫过去记录三分一sum[n]的个数，遇到三分二sum[n]的就加答案；

总结：细节没注意！

#include<bits/stdc++.h>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(