Codeforces Round #544(Div.3)C. Balanced Team解题报告

题目链接

C. Balanced Team time limit per test:2 seconds memory limit per test:256 megabytes input:standard input output:standard 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 $a_i$.

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\le n\le 2\cdot 10^5)$ — the number of students.

The second line of the input contains $n$ integers $a_1,a_2,\dots ,a_n(1\le a_i\le 10^9)$, where $a_i$ is a programming skill of the $i$-th student.

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

Examples

input
6
1 10 17 12 15 2
output
3

input
10
1337 1337 1337 1337 1337 1337 1337 1337 1337 1337
output
10

input
6
1 1000 10000 10 100 1000000000
output
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).

题目大意

有$n$个学生，每个学生都有一个能力值$a_i$，在$n$个学生中选$k$个学生，使得$k$个学生中能力最大值与最小值的差不超过$5$，问$k$的最大值。

解题思路

首先，读完这道题目之后第一反应肯定是先对能力值进行一个排序，然后呢？思考一个问题就是对于某一个点$i$，它到底与那个点进行作差比较?所以我就另外开一个数组来记录一下每一个点满足$k$最大的对应选择中最小值的下标值，每一次比较就可以找到下标值存的值进行比较。

AC代码

#include<bits/stdc++.h>
const int Max_N=2e5+6;
using namespace std;
int a[Max_N];
int dp[Max_N];
bool cmp(int a,int b)
{
	return a<b;
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1,cmp);
	int res=0,ans=1;
	dp[1]=1;
	for(int i=2;i<=n;i++)
	{
		if(a[i]-a[dp[i-1]]<=5)
		{
			dp[i]=dp[i-1];
			ans++;
		}
		else
		{//不满足条件进行更新
			res=max(res,ans);
			for(int j=dp[i-1]+1;j<=i;j++)
			{
				if(a[i]-a[j]<=5)
				{
					dp[i]=j;
					ans=ans-(j-dp[i-1])+1;
					break;
				}
			}
		}
	}
	res=max(res,ans);
	cout<<res<<endl;
}

总结

看完题目，理解求什么，把问题简单化，逐个击破。