poj 3069 2018-2-7
2018-02-07 21:45
281 查看
using namespace std; int a[1010]; int main() { int n,R,i,ans; while(scanf("%d%d",&R,&n)&&R!=-1||n!=-1) { for(i=0;i<n;++i) scanf("%d",&a[i]); sort(a,a+n); i=0;ans=0; while(i<n) { int s=a[i++]; while(i<n&&a[i]<=s+R) i++; int p=a[i-1]; while(i<n&&a[i]<=p+R) i++; ans++; } printf("%d\n",ans); } return 0; }
相关文章推荐
- POJ 3069
- POJ 3069 Saruman's Army(贪心)
- Saruman's Army (POJ 3069)
- poj-3069-Saruman's Army
- poj 3069 Saruman's Army
- POJ 3069 Saruman's Army
- 贪心算法poj 3617,3069,3253
- poj 3069 贪心
- poj 3069 Saruman's Army
- poj 3069 Saruman's Army 贪心
- poj 3069 Saruman' Army
- POJ 3069 Saruman's Army
- POJ 3069 Saruman's Army
- POJ 3069 Saruman's Army
- poj 3069 Saruman's Army
- POJ - 3069 Saruman's Army (贪心)
- POJ 3069-Saruman's Army [贪心] 《挑战程序设计竞赛》2.2
- poj----3069
- poj 3069 Saruman's Army (贪心)
- POJ 3069 Saruman's Army (贪心)