[挑战程序设计竞赛] POJ 3069 - Saruman's Army

来源：互联网发布：网红男装淘宝店有哪些编辑：程序博客网时间：2024/05/22 11:35

模拟题，排序贪心即可。当时写的比较挫，界限处理错了WA了好几次。。

#include <stdio.h>#include <string.h>#include <math.h>#include <stdlib.h>#include <algorithm>#include <iostream>#include <set>#include <map>#include <queue>#include <stack>#include <assert.h>#include <time.h>typedef long long LL;const int INF = 500000001;const double EPS = 1e-9;const double PI = acos(-1.0);using namespace std;int main(){    //freopen("test0.in", "r", stdin);    //freopen("test0.out", "w", stdout);    //srand(time(NULL));    int N, R, a[1001];    while(~scanf("%d", &R))    {        scanf("%d", &N);        if(N == -1 && R == -1) break;        for(int i = 0; i < N; i++)        {            scanf("%d", &a[i]);        }        sort(a, a+N);        int left, mid;        int sum = 0;        int i = 0;        while(i < N)        {            left = a[i++];            while(left + R >= a[i]) i++;            mid = a[i-1];            while(mid + R >= a[i]) i++;            ++sum;        }        printf("%d\n", sum);    }    return 0;}

0 0