Codeforces Round #813 (Div. 2)ABC

目录

A

B 

C 

---

CF打了一个假期 上1k分了哈哈（cong0开始）接下来博客就断断续续更了

A

#include<bits/stdc++.h>
using namespace std;
int main(){
	int _;
	cin>>_;
	while(_--){
		int n,k;
		cin>>n>>k;
		int res = 0;
		int a[n+1];
		for(int i = 1;i<=n;i++) cin>>a[i];
		for(int i = 1;i<=k;i++) res+=(a[i]>k);
		cout<<res<<endl;
	}
	return 0;
}

B 

 

#include<bits/stdc++.h>
using namespace std;
int main(){
	int _;
	cin>>_;
	while(_--){
		int n;
		cin>>n;
		int a[n+1];
		if(n==1){
			cout<<"1"<<endl;
		}else{
			for(int i = 1;i<=n;i++)
			a[i]=i;
			for(int i = (n%2?3:2);i<=n;i+=2)
			swap(a[i-1],a[i]);
			for(int i = 1;i<=n;i++)
			cout<<a[i]<<" \n"[i==n];		}
	}
	return 0;
}

C 

#include<bits/stdc++.h>
using namespace std;
int main(){
	int _;
	cin>>_;
	while(_--){
		int m;
		cin>>m;
		int hh = m;
		int a[m+1],h[m+1];
		for(int i = 1;i<=m;i++) h[i]=0;
		for(int r = 1;r<=m;r++){
			cin>>a[r];
			if(!h[a[r]]) h[a[r]] = r;
		}
		
		while(hh-1>=1&&a[hh-1]<=a[hh]) hh--;
		for(int j = m;j>=1;j--){
			if(h[a[j]]<hh){
				hh=j+1;
				break;
			}
		}
		hh--;
		set<int>ss;
		ss.clear();
		for(int k = 1;k<=hh;k++){
			ss.insert(a[k]);
		}
		cout<<(ss.size())<<endl;
	}
	return 0;
}