1133C. Balanced Team BY MRHAO61 uppper_bound(begin,end,num)//从begin到end，返回小于等于num在数组中的下角标

C. Balanced Team
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are a coach at your local university. There are n students under your supervision, the programming skill of the i-th student is ai.

You have to create a team for a new programming competition. As you know, the more students some team has the more probable its victory is! So you have to create a team with the maximum number of students. But you also know that a team should be balanced. It means that the programming skill of each pair of students in a created team should differ by no more than 5.

Your task is to report the maximum possible number of students in a balanced team.

Input
The first line of the input contains one integer n (1≤n≤2⋅105) — the number of students.

The second line of the input contains n integers a1,a2,…,an (1≤ai≤109), where ai is a programming skill of the i-th student.

Output
Print one integer — the maximum possible number of students in a balanced team.

Examples
inputCopy
6
1 10 17 12 15 2
outputCopy
3
inputCopy
10
1337 1337 1337 1337 1337 1337 1337 1337 1337 1337
outputCopy
10
inputCopy
6
1 1000 10000 10 100 1000000000
outputCopy
1
Note
In the first example you can create a team with skills [12,17,15].

In the second example you can take all students in a team because their programming skills are equal.

In the third example you can create a team consisting of a single student (and you cannot create a team consisting of at least two students).

#include<iostream>
#include<algorithm>
#define maxn 200009
using namespace std;
int main()
{
	long long int n;cin>>n;
	int a[maxn];
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		int w;
		w=upper_bound(a+1,a+1+n,a[i]+5)-a;//获得满足条件的角标+1 
		ans=max(ans,w-i);
	}
	cout<<ans; 
}

超时代码

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(int a,int b)
{
	return a<b;
}
int main()
{
	long long int n;cin>>n;
	vector<int>a;
	for(long long int i=0;i<n;i++)
	{
		long long int x;cin>>x;
		a.push_back(x);
	}
	sort(a.begin(),a.end());
	long long int ans=1,max=1;
	for(long long int i=0;i<n;i++)//cong i dao j zhi jian zui duo ke yi you ji ge
	{
		for(long long int j=i+1;j<n;j++)
		{
			if(a[j]-a[i]<=5)
				ans++;
		}
		if(ans>max)
		{
			max=ans;
		}
		ans=1;
	}
	cout<<max;
}

lower_bound( )和upper_bound( )都是利用二分查找的方法在一个排好序的数组中进行查找的。

在从小到大的排序数组中，

lower_bound( begin,end,num)：从数组的begin位置到end-1位置二分查找第一个大于或等于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

upper_bound( begin,end,num)：从数组的begin位置到end-1位置二分查找第一个大于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

在从大到小的排序数组中，重载lower_bound()和upper_bound()

lower_bound( begin,end,num,greater() ):从数组的begin位置到end-1位置二分查找第一个小于或等于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

upper_bound( begin,end,num,greater() ):从数组的begin位置到end-1位置二分查找第一个小于num的数字，找到返回该数字的地址，不存在则返回end。通过返回的地址减去起始地址begin,得到找到数字在数组中的下标。

#include<bits/stdc++.h>
using namespace std;
const int maxn=100000+10;
const int INF=2*int(1e9)+10;
#define LL long long
int cmd(int a,int b){
	return a>b;
}
int main(){
	int num[6]={1,2,4,7,15,34}; 
	sort(num,num+6);                           //按从小到大排序 
	int pos1=lower_bound(num,num+6,7)-num;    //返回数组中第一个大于或等于被查数的值 
	int pos2=upper_bound(num,num+6,7)-num;    //返回数组中第一个大于被查数的值
	cout<<pos1<<" "<<num[pos1]<<endl;
	cout<<pos2<<" "<<num[pos2]<<endl;
	sort(num,num+6,cmd);                      //按从大到小排序
	int pos3=lower_bound(num,num+6,7,greater<int>())-num;  //返回数组中第一个小于或等于被查数的值 
	int pos4=upper_bound(num,num+6,7,greater<int>())-num;  //返回数组中第一个小于被查数的值 
	cout<<pos3<<" "<<num[pos3]<<endl;
	cout<<pos4<<" "<<num[pos4]<<endl;
	return 0;	
}