1614C Divan and bitwise operations

尺取法模板
注意 每次取出的钱不能超过ATM机剩余的余额：
$sum+a[t]+S>=0$

typedef long long ll;
const int N = 2e5+10;

int n;
ll S, a[N];

void solve()
{
	scanf("%d %lld", &n, &S);
	for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
	int res = 0;
	ll sum = 0;
	int s = 1, t = 1, l = 0, r = 0;
	while(1)
	{
		while(t <= n && sum + a[t] + S >= 0) sum += a[t++];
		//if(sum + S < 0) break;  // 
		if(t - s > res) {
			res = t - s;
			l = s;
			r = t - 1;
		} 
		if(t >= n && s >= n) break;
		sum -= a[s++];
	}
	if(!res) printf("-1\n");
	else printf("%d %d\n",l,r);
}