PJ 2566 Bound Found (尺取法)

#include<stdio.h>
#include<string.h>
#include<algorithm>

using namespace std;

const int maxn=1e5+5;
int n,k;
pair<int,int>E[maxn];
int solve(int x)//尺取法并不是简单的暴力
{
    int l=0,r=1;
    int dis=1e9+5,ui,op;
    int ans;
    while(l<=n&&r<=n&&dis)
    {
        int temp=E[r].first-E[l].first;
        if(dis>abs(temp-x))
        {
            dis=abs(temp-x);
            ans=temp;
            ui=E[l].second;
            op=E[r].second;
            //printf("%d %d\n",ui,op);
        }
        if(temp<x)  r++;
        if(temp>x)   l++;
        if(l==r)    r++;
    }
    if(ui>op)   swap(ui,op);//？？？？？？？？？
    //printf("%d %d\n",ui,op);
    //printf("%d %d\n",E[ui].first,E[op].first);
    printf("%d %d %d\n",ans,ui+1,op);
}
int main()//这道题有些细节问题没搞懂。
{
    while(~scanf("%d%d",&n,&k))
    {
        int temp=0;
        E[0]=make_pair(0,0);
        for(int i=1;i<=n;i++)
        {
            int x;  scanf("%d",&x);
            temp=temp+x;
            E[i]=make_pair(temp,i);
        }
        sort(E,E+1+n);
        for(int i=1;i<=k;i++)
        {
            int u;  scanf("%d",&u);
            solve(u);
        }
    }
}

 

Bound Found

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 3100		Accepted: 959		Special Judge

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

Source

Ulm Local 2001