POJ 3609 Saruman's Army 贪心

从坐开始，贪心选择每个点标记还是不标记。

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<sstream>
#include<cmath>
#include<climits>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define pb(a) push(a)
#define INF 0x1f1f1f1f
#define lson idx<<1,l,mid
#define rson idx<<1|1,mid+1,r
#define PI  3.1415926535898
template<class T> T min(const T& a,const T& b,const T& c) {
    return min(min(a,b),min(a,c));
}
template<class T> T max(const T& a,const T& b,const T& c) {
    return max(max(a,b),max(a,c));
}
void debug() {
#ifdef ONLINE_JUDGE
#else

    freopen("in.txt","r",stdin);
    //freopen("d:\\out1.txt","w",stdout);
#endif
}
int getch() {
    int ch;
    while((ch=getchar())!=EOF) {
        if(ch!=' '&&ch!='\n')return ch;
    }
    return EOF;
}

const int maxn=1005;
int n,R;
int point[maxn];

int main()
{
    while(scanf("%d%d",&R,&n)!=EOF&&n!=-1)
    {
        for(int i=0;i<n;i++)
            scanf("%d",&point[i]);
        sort(point,point+n);
        int cnt=0,last=point[0];
        for(int i=0;i<n;)
        {
            if(i+1==n||point[i+1]>last+R)
            {
                cnt++;
                int x=point[i];
                i++;while(i<n&&point[i]<=x+R)i++;
                last=point[i];
            }else i++;
        }
        printf("%d\n",cnt);
    }
    return 0;
}

View Code

 

转载于:https://www.cnblogs.com/BMan/p/3645318.html