Balanced Team

https://codeforces.com/contest/1133/problem/C

题解：尺取法

参考文章：https://blog.csdn.net/weixin_43272781/article/details/83717797

C++版本一

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=200000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{};
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}sort(a+1,a+n+1);int pos=1;int len=1;for(int i=2;i<=n;i++){if(abs(a[pos]-a[i])<=5){len++;}else{ans=max(len,ans);while(abs(a[++pos]-a[i])>5);len=i-pos+1;}}ans=max(len,ans);cout<<ans<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

C++版本二

优化版本

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=200000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{};
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}sort(a+1,a+n+1);int l=1;int r=1;while(l<=r&&r<=n){if(a[r]-a[l]<=5){ans=max(r-l+1,ans);r++;}else{l++;}}//ans=max(r-l+1,ans);cout<<ans<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

Balanced Team相关推荐

HTML期末学生大作业-乒乓球网页作业html+css+javascript
一.部分网页截图二.部分源代码 <div id="cbx-aboutus" class="cbx-section cbx-aboutus">< ...
How DICK’S moved its software development in-house and aced omnichannel retail
Learn about Pivotal Labs Pivotal is now part of VMware, so some of these products and services are n ...
Codeforces Round 1133(Div.3)题解
A 思路做法显然,但是需要注意一些小的细节: ①不能输出如"2:2"这样的时间,必须输出"02:02"这样的时间: ②中间的冒号是":", ...
Mind the GAP: A Balanced Corpus of Gendered Ambiguous Pronouns--论文笔记
Mind the GAP: A Balanced Corpus of Gendered Ambiguous Pronouns 注意差距: 性别歧义代词的平衡语料库 Abstract Coreferen ...
Visual Studio 2005 Team System下载地址
注册一个msn就可以去微软下载了,关于替换序列号变成正版的方法我没有试,team suite 我在用,但Team Foundation Server 我还没有安装好 Microsoft Visual ...
高级网络配置《 bond team桥接》的建立
bond 资料详情一.链路聚合:以太网链路聚合简称链路聚合,它通过将多条以太网物理链路捆绑在一起成为一条逻辑链路,从而实现增加链路带宽的目的.同时,这些捆绑在一起的链路通过相互间的动态备份,可以有效 ...
安装Team Services Agent Win7
现状:项目现时使用的是Team Services,使用Team Services可以控制其中的一台Build Server,从Github提取代码,并在Build Server进入编译打包处理(son ...
SP11469 SUBSET - Balanced Cow Subsets（折半搜索+状态压缩）难度⭐⭐⭐⭐★
题目链接 SP11469 SUBSET - Balanced Cow Subsets 题目翻译给出N(1≤N≤20)N(1≤N≤20)N(1≤N≤20)个数M(i)(1<=M(i)<=1 ...
微软MSIT部门招Sr SDE for FSS team
Job Description: Qualifications Do you want to design and build the services and solutions that are ...

Balanced Team

Balanced Team相关推荐

最新文章

热门文章