CodeForces 940A Points on the line
2018-02-25 10:56
375 查看
题意:给两个数n和d,然后输入n个数,问最少要删掉几个数才能让剩下的n个数的任意两个数相差不大于d
AC代码:#include <iostream>
#include <cstdio>
#include <algorithm>
#define MAXN 105
#define MAX(a,b) a>b?a:b
using namespace std;
int n,d,mx;
int pre[MAXN];
int main()
{
mx = -1;
scanf("%d%d",&n,&d);
for(int i=0;i<n;i++) scanf("%d",&pre[i]);
sort(pre,pre+n);
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
if(pre[j] - pre[i] <= d){
mx = MAX(mx,j-i+1);
}
}
}
printf("%d\n",n - mx);
return 0;
}
AC代码:#include <iostream>
#include <cstdio>
#include <algorithm>
#define MAXN 105
#define MAX(a,b) a>b?a:b
using namespace std;
int n,d,mx;
int pre[MAXN];
int main()
{
mx = -1;
scanf("%d%d",&n,&d);
for(int i=0;i<n;i++) scanf("%d",&pre[i]);
sort(pre,pre+n);
for(int i=0;i<n;i++){
for(int j=i;j<n;j++){
if(pre[j] - pre[i] <= d){
mx = MAX(mx,j-i+1);
}
}
}
printf("%d\n",n - mx);
return 0;
}
相关文章推荐
- CodeForces 547A--找循环节
- codeforces contest 358
- Codeforces Alpha Round #21 (Codeforces format) D. Traveling Graph
- Codeforces 435B. Pasha Maximizes
- codeforces 832 D Misha, Grisha and Underground(倍增)
- [CodeForces]String Reconstruction
- Codeforces 161D Distance in Tree
- CodeForces - 357C C - Knight Tournament 并查集or set模拟
- 【关于codeforces比赛规则介绍】(转载)
- Codeforces 204A Little Elephant and Interval(数位统计)
- Codeforces 527C Glass Carving<set集合和multiset集合的使用>
- CodeForces 156 C.Cipher(dp)
- CodeForces 688A-Opponents
- CodeForces 735D - Taxes
- CodeForces 490E Restoring Increasing Sequence
- codeforces 621A Wet Shark and Odd and Even
- codeforces 706B Interesting drink
- CodeForces 251 A.Points on Line(二分)
- CodeForces 166A Rank List
- CodeForces.5A Chat Server's Outgoin 4000 g Traffic