poj 2566 Bound Found（尺取法）

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<set>
#include<stack>
#include<map>
#include<unordered_map>
#include<cmath>
using namespace std;
const int N = 100003, inf = 0x3f3f3f3f;
typedef pair<int, int> PIR;
typedef long long ll;

PIR p[N];


/*
尺取法必须保证所选区间是单调的，因为序列有正有负，不能保证区间单调，所以需要对前缀排序
*/
int main()
{
	int n, k;
	
	while (cin >> n >> k, n || k)
	{
		//memset(p, 0, sizeof p);
		p[0].first = 0, p[0].second = 0;
		for (int i = 1; i <= n; i++)
		{
			int x;
			cin >> x;
			p[i].first = p[i - 1].first + x;
			p[i].second = i;
		}
		sort(p , p + n + 1);//从p开始，而不是从p+1开始，这里很关键！
		while (k--)
		{
			int t;
			cin >> t;

			int l = 0, r = 1, res = inf, sum = 0;
			int resl = 0, resr = 1, ans ;
			while (r <= n)
			{
				sum = abs(p[r].first - p[l].first);
				if (abs(sum - t) < res)
				{
					res = abs(sum - t);
					resl = p[l].second , resr = p[r].second ;
					ans = sum;
				}


				if (sum > t)
					l++;
				else if (sum < t)
					r++;
				else
					break;
				if (l == r)
					r++;

			}
			if (resl > resr)
				swap(resl, resr);
			cout << ans << ' ' << resl + 1 << ' ' << resr << endl;
		}
	}

	return 0;
}