[每日一题]:Codeforces Round #632 (Div. 2) C. Eugene and an array
题目:样例:题目大意:给一个数组序列,问子串的和不为0的数量。(子串是连续的哦)考察点:前缀和、尺取、set的用法、思维图解:Code:#include#include#include#include#include#includeusingnamespacestd;typedeflonglongLL;constintmaxn=2e5+10;LLa[maxn],pre[maxn];LLn,res=