POJ 3618 Exploration 绝对值排序(技巧)

Problem W

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 27   Accepted Submission(s) : 5

Problem Description

Bessie is traveling on a road teeming with interesting landmarks. The road is labeled just like a number line, and Bessie starts at the "origin" (x = 0). A total of N (1 ≤ N ≤ 50,000) landmarks are located at points x₁, x₂, ..., x_N (-100,000 ≤ x_i ≤ 100,000). Bessie wants to visit as many landmarks as possible before sundown, which occurs in T (1 ≤ T ≤ 1,000,000,000) minutes. She travels 1 distance unit in 1 minute.

Bessie will visit the landmarks in a particular order. Since the landmarks closer to the origin are more important to Farmer John, she always heads for the unvisited landmark closest to the origin. No two landmarks will be the same distance away from the origin.

Help Bessie determine the maximum number of landmarks she can visit before the day ends.

 

Input

<p>* Line 1: Two space-separated integers: <i>T</i> and <i>N</i><br>* Lines 2..<i>N</i>+1: Line <i>i</i>+1 contains a single integer that is the location of the <i>i</i>th landmark: <i>x_i</i></p>

 

Output

<p>* Line 1: The maximum number of landmarks Bessie can visit.</p>

 

Sample Input

25 5 10 -3 8 -7 1

 

Sample Output

4

 

Statistic | Submit | Back 

  题意：求在一定时间内能够到参观最多的坐标建筑；

 绝对值排序，用下一个坐标减去前一个，累加不超过时间，累计一次访问的地点加1

#include<iostream>
#include<string>
#include<cstdio>
using namespace std;
char a[2002];
bool check(int l,int r)
{
    while(l<=r)
    {
        if(a[l]==a[r])
        {
            l++;
            r--;
        }
        else if(a[l]>a[r]) return false;
             else return true;
    }
    return true;
}
int main()
{
    int n,sigh;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%c ",&a[i]);
    }
    int l=1,r=n;
    while(l<=r)
    {
       if(a[l]<a[r]) cout<<a[l++];
          else
       if(a[l]>a[r]) cout<<a[r--];
           else if(check(l,r)) cout<<a[l++];
                else cout<<a[r--];
        sigh++;
        if(sigh==80)
            {
            cout<<endl;
            sigh=0;
            }
   }
   return 0;
}