牛客周赛 Round 35补题

#include <bits/stdc++.h>
#define int long long
#define ls(x) x << 1
#define lowbit(x) ((x) & (-x))
#define rs(x) x << 1 | 1
#define all(x) x.begin(), x.end()
using namespace std;
const int inf = 1e18;
const int mod = 1e9 + 7;
void init() {}
int qsm(int x, int y)
{
    int res = 1;
    while (y)
    {
        if (y & 1)
            res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    cout << s.substr(0, n / 2) << "\n"
         << s.substr(n / 2) << "\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

#include <bits/stdc++.h>
#define int long long
#define ls(x) x << 1
#define lowbit(x) ((x) & (-x))
#define rs(x) x << 1 | 1
#define all(x) x.begin(), x.end()
using namespace std;
const int inf = 1e18;
const int mod = 1e9 + 7;
void init() {}
int qsm(int x, int y)
{
    int res = 1;
    while (y)
    {
        if (y & 1)
            res = res * x % mod;
        y >>= 1;
        x = x * x % mod;
    }
    return res;
}
void solve()
{
    string s;
    cin >> s;
    int n = s.size();
    cout << s.substr(0, n / 2) << "\n"
         << s.substr(n / 2) << "\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<map>
#include<vector>
using namespace std;
const int N=1e5+10;
int a[N];
int n,k;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
    int mx=0,r=1,l=1;
    while(r<=n){
        if(a[r]-a[l]>k) l++;
        mx=max(mx,r-l+1);
        r++;
    }
    double res;
    res=(1.0*mx)/n;
    cout<<res<<'\n';
    return 0;
}