poj-3069
2014-10-24 00:23
218 查看
贪心算法
#include "stdio.h" #include "string.h" #include "math.h" #include "stdlib.h" #include <iostream> #include <algorithm> #include <stdlib.h> #include <queue> using namespace std; int a[1010]; int main() { int r ,n,i; while (scanf ("%d%d",&r,&n)!=EOF && (r!=-1 && n != -1) ) { for (i=1;i<=n;i++) { scanf ("%d",&a[i]); } sort(a+1,a+1+n); i=1; int 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 Saruman's Army (贪心)
- Saruman's Army POJ - 3069
- poj 3069
- 贪心基础题(区间调度问题+POJ_3617+POJ_3069)
- poj 3069 Saruman's Army
- POJ 3069
- poj 3069 Saruman's Army
- POJ 3069 Saruman's Army (贪心 )
- D - Saruman's Army POJ - 3069
- POJ 3069-Saruman's Army [贪心] 《挑战程序设计竞赛》2.2
- 刷题——Saruman's Army POJ - 3069
- poj 3069
- POJ 3069 Saruman's Army
- POJ 3069 Saruman's Army (贪心)
- POJ 3069 Saruman's Army(贪心)
- poj 3069(贪心算法之字典序排序)
- poj 3069 Saruman's Army
- POJ 3069 Saruman's Army 线段的覆盖 贪心
- Saruman's Army POJ - 3069
- 贪心算法poj 3617,3069,3253