每日OJ题_牛客_dd爱框框（滑动窗口）

目录

dd爱框框（滑动窗口）

解析代码

---

dd爱框框（滑动窗口）

dd爱框框_牛客题霸_牛客网

---

解析代码

基础同向双指针算法。关于滑动窗口的介绍可看这篇：Offer必备算法02_滑动窗口_八道力扣OJ题详解（由易到难）_力扣滑动窗口得题目-CSDN博客

#include <iostream>
#include <vector>
#include <climits>

using namespace std;
int main()
{
	int n = 0, x = 0;
	cin >> n >> x;
	vector<int> v(n);
	for (int i = 0; i < n; ++i)
	{
		cin >> v[i];
	}
	int res1 = 0, res2 = 0, reslen = INT_MAX, sum = 0;
	for (int left = 0, right = 0; right < n; ++right)
	{
		sum += v[right];
		while (sum >= x)
		{
			if (right - left + 1 < reslen)
			{
				res1 = left;
				res2 = right;
				reslen = right - left + 1;
			}
			sum -= v[left++];
		}
	}
	cout << res1 + 1 << " " << res2 + 1;
	return 0;
}