Bus Stop

題目描述

In a rural village in Thailand, there is a long, straight, road with houses scattered along it.
(We can picture the road as a long line segment, with an eastern endpoint and a western endpoint.) The Thai government is planning to set up bus stops on this road in such a way that every house is within ten kilometers of one of the stops. What is the minimum number of stops the government need to set up to satisfy the requirement?

輸入

The first line contains a single integer m representing the number of the test cases. Eachtest case consists of the following two lines:
The first line contains a single integer n representing the number of houses on the road, where 0 ≤ n ≤ 2,000,000.
The second line contains n integers h1 h2 … hn representing the locations of the houses in kilometers as measured from the start of the road, where 0 ≤ hi ≤ 90,000,000. That is, the first house is h1 kilometers away from the start of the road, the second house is h2 kilometers

輸出

For each test case, print out in a single line the minimum number of bus stops that satisfy the requirement.

樣例輸入

2
5
1 2 3 200 210
4
10 30 80 200

樣例輸出

2
3

題意

建立公交站 每個站的範圍是10 給你一些位置問需要多少個公交站

題解

水題 從頭遍歷 記錄上一個站的位置 如果不在上一個站範圍內 就重建一個

代碼

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<n;i++)
#define scac(x) scanf("%c",&x)
#define sca(x) scanf("%d",&x)
#define sca2(x,y) scanf("%d%d",&x,&y)
#define sca3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define scl(x) scanf("%lld",&x)
#define scl2(x,y) scanf("%lld%lld",&x,&y)
#define scl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z)
#define pri(x) printf("%d\n",x)
#define pri2(x,y) printf("%d %d\n",x,y)
#define pri3(x,y,z) printf("%d %d %d\n",x,y,z)
#define prl(x) printf("%lld\n",x)
#define prl2(x,y) printf("%lld %lld\n",x,y)
#define prl3(x,y,z) printf("%lld %lld %lld\n",x,y,z)
#define ll long long
#define LL long long
#define pb push_back
#define mp make_pair
#define P pair<int,int>
#define PLL pair<ll,ll>
#define PI acos(1.0)
#define eps 1e-6
#define inf 1e17
#define INF 0x3f3f3f3f
#define N 5005
const int maxn = 2000005;
int t,n;
int a[maxn];
int main()
{
  sca(t);
  while(t--)
  {
    sca(n);
    rep(i,0,n)
       sca(a[i]);
    int mx = -100;
    int ans = 0;
    rep(i,0,n)
    {
      if(mx + 10 < a[i])
      {
        mx = a[i] + 10;
        ans++;
      }
    }
    pri(ans);
  }
}

upc組隊賽14 Bus stop【簽到水】