F1. Same Sum Blocks (Easy) and F2. Same Sum Blocks (Hard)

 http://codeforces.com/contest/1141/problem/F2

题意：问最多区间和相等的不重合的区间个数；

思路：优雅暴力，枚举区间是重点，因为不重合所以每次固定r枚举l，能在判断是否重合时进行贪心地选择！！！

总结：容器的结合应用！！，区间枚举的不同有优点！

#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
#def