Saruman's Army POJ

#include <cstdio>#include <algorithm>using namespace std;int r,n,t,sum,buf,p;int d[1010];int main(){while (~scanf ("%d%d",&r,&n) && r!=-1 && n!=-1) {for (int i=0;i<n;i++) scanf ("%d",&d[i]);sort(d,d+n);t=0;sum=0;while (t<n) {buf=d[t++];while (t<n && d[t]<=buf+r) t++;p=d[t-1];while (t<n && d[t]<=p+r) t++;sum++;}printf ("%d\n",sum);} return 0;}