G-ATM and student

#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n, a[2000000], ansl, ansr;
ll s, sum;
int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        cin >> n >> s;
        for(int i=0;i<n;i++) cin >> a[i];
        sum = 0;ll ans = -1,r = -1;
        for(int i=0;i<n;i++)
        {
            if (r < i)
                r = i, sum = a[i];//r临时的右端点便于合适区间查找和更新
            while (r < n && s + sum >= 0)//寻找合适区间并更新左右端点
            {
                if (r - i + 1 > ans)
                    ans = r-i+1, ansl=i, ansr=r;
                r++, sum += a[r];
            }
            if (r < n)
                sum -= a[r], r--;
            else
                break;
            sum-=a[i];
        }
        if (ans == -1)//如果没有满足条件的区间
            cout << ans << endl;
        else
            cout << ansl + 1 << ' ' << ansr + 1 << endl;//输出满足条件的左右端点
    }
    return 0;
}