数组三分（滑动窗口）好题好题

#include#includeusing namespace std;const int N = 100010;int n;long long s[N];long long ans;long long  a[N];int main() {cin >> n;for (int i = 1; i > s[i];s[i] += s[i - 1];}int j = 2;int ll = 0, rr = 0;//左右指针for (int i = 1; i  r)continue;while ( s[rr] <= r && rr<=n-1)rr++;while (s[ll] < l && ll <= n-1)ll++;ll = max(ll, i + 1);ans += (rr - ll);}cout << ans;return 0;}