2021暑假集训-个人赛11

---

A.Simply Strange Sort

传送门
题目大意：有两种操作，一种是偶数只对偶数和他后面的进行判断，如果前面大，前后就进行交换
，同理奇数也是这样，奇数跟偶数是对操作总数判断的，目的是找到最小的操作数使其变为升序
思路：判断是否为升序，然后操作就好

#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 FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f;
const ll Max=1000;
using namespace std;
int t,n,m;
int 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("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        FO(i,n)
        {
            scanf("%d",&a[i]);
        }
        int sum=0;
        while(!is_sorted(a,a+n))
        {
            for(int i=sum%2;i<n-1;i+=2)
            {
                if(a[i]>a[i+1])
                    swap(a[i],a[i+1]);
            }sum++;
        }
        cout<<sum<<endl;

    }
    return 0;
}

B.Charmed by the Game *

传送门

C.Deep Down Below

传送门

#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 FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f;
const ll Max=100005;
using namespace std;
ll t,n,m;
pair<ll,ll> a[Max];//为了左边最大相同时，比较长度
ll b[Max];
ll c[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--)
    {
        scanf("%lld",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%lld",&m);
            ll x,maxx=-INF;
            for(int j=1;j<=m;j++)
                scanf("%lld",&x),maxx=max(maxx,x+1-j+1);//满足情况，并需要的最大值
                a[i]=make_pair(maxx,m);
        }
       ll sum=0,l=0;//左边界
	     sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		if(l<=a[i].first){
			ll w=a[i].first-l;//更新最小
			sum+=w;
			l+=w;
		}
		l+=a[i].second;//能提供给的最大
	}
	printf("%lld\n",sum);
    }
    return 0;
}

D.Up the Strip (simplified version) *

传送门

E.Up the Strip *

传送门

F.Bottom-Tier Reversals *

传送门

G.Top-Notch Insertions *

传送门