POJ 2566

Problem Description

Signals of most probably extra-terrestrial origin have been received and digitalized by The Aeronautic and Space Administration (that must be going through a defiant phase: "But I want to use feet, not meters!"). Each signal seems to come in two parts: a sequence of n integer values and a non-negative integer t. We'll not go into details, but researchers found out that a signal encodes two integer values. These can be found as the lower and upper bound of a subrange of the sequence whose absolute value of its sum is closest to t.

You are given the sequence of n integers and the non-negative target t. You are to find a non-empty range of the sequence (i.e. a continuous subsequence) and output its lower index l and its upper index u. The absolute value of the sum of the values of the sequence from the l-th to the u-th element (inclusive) must be at least as close to t as the absolute value of the sum of any other non-empty range.

 

Input

The input file contains several test cases. Each test case starts with two numbers n and k. Input is terminated by n=k=0. Otherwise, 1<=n<=100000 and there follow n integers with absolute values <=10000 which constitute the sequence. Then follow k queries for this sequence. Each query is a target t with 0<=t<=1000000000.

 

Output

For each query output 3 numbers on a line: some closest absolute sum and the lower and upper indices of some range where this absolute sum is achieved. Possible indices start with 1 and go up to n.

 

Sample Input

5 1
-10 -5 0 5 10
3
10 2
-9 8 -7 6 -5 4 -3 2 -1 0
5 11
15 2
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
15 100
0 0

 

Sample Output

5 4 4
5 2 8
9 1 1
15 1 15
15 1 15

 

题意:

给你n个数字，这些数字可正可负，再给你个数字t,求在这个数列中一个连续的子序列，和的绝对值与t相差最小，输出这个和，和序列的左右端点。

 

思路：

先用前缀和预处理一下，再排序，然后再用尺取法

 

代码：

#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<vector>
using namespace std;
const int N=1e5+1000;
typedef long long LL;
const int inf=0x3f3f3f3f;
pair<int,int>s[N];
LL abs1(LL b)
{
	return b>=0?b:-b;
}
int main()
{
	int n,k;
	while(scanf("%d %d",&n,&k),n+k)
        {
		s[0]=make_pair(0,0);
		for(int i=1;i<=n;i++)
		{
			int x;
			scanf("%d",&x);
			s[i]=make_pair(s[i-1].first+x,i);
		}
		sort(s,s+n+1);
		while(k--)
                {
			LL t;
			scanf("%lld",&t);
			LL sum=0;
			int minn=inf;
			int ll=0,rr=1;
			int l,r;
			LL ans;
			while(rr<=n)
			{
				LL tt=s[rr].first-s[ll].first;
				if(abs1(tt-t)<minn)
				{
					minn=abs1(tt-t);
					ans=tt;
					l=s[ll].second;
					r=s[rr].second;
				}
				if(tt>t) ll++;
                                else if(tt<t) rr++;
				else break;
				if(ll==rr) rr++;

			}
			if(l>r) swap(l,r);
			printf("%lld %d %d\n",ans,l+1,r);
		}
    }
	return 0;
}