2021暑假集训-个人赛5

---

A.Ezzat and Two Subsequences

传送门
思路：最大值加上剩下的平均数

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=1e5+7;
using namespace std;
ll t,n,m;
ll a[Max];
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{   scanf("%lld",&t);
    while(t--)
    {   ll sum=0;
        scanf("%lld",&n);
        for(ll i=0;i<n;i++)
        {scanf("%lld",&a[i]);
         sum+=a[i];
        }
        sort(a,a+n);
        printf("%.9lf\n",1.0*a[n-1]+1.0*(sum-a[n-1])/(n-1));
    }
    return 0;
}

B.Moamen and k-subarrays

传送门
题目大意：就是给你一个任意顺序的数组，问你将他们分组，然后排成升序，最少需要分几组
思路：用一个结构体，存他的数据和一开始的位置，然后对数据进行升序排序，如果前后两个不满足初始位置后面比前面大一，计数器就加一

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define REP( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll INF=0x3f3f3f3f;
const ll Max=1e5+7;
using namespace std;
int t,n,m;
struct node
{
    int num;
    int a;
}w[Max];
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
bool cmp(node a,node b)
{
    return a.a<b.a;
}
int main()
{   scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&w[i].a);
            w[i].num=i;
        }
        sort(w+1,w+n+1,cmp);
        int sum=1;
        for(int i=1;i<n;i++)
            {if(w[i].num!=w[i+1].num-1) sum++;
            }
        if(sum<=m)
            printf("Yes\n");
        else printf("No\n");

    }
    return 0;
}

C.Moamen and XOR *

传送门

D.Ezzat and Grid *

传送门

E.Assiut Chess *

传送门