Codeforces Round #837 (Div. 2)(补）

最近太忙赶紧补上

A. 找最大值和最小值 如果都是一样的 就n*n-1

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define mkp make_pair
#define ll long long
#define sz(i) (i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int N=1e3+10;
const int M=6e4+5;
const int INF=0x3f3f3f3f;
const ll mod=1e9+7;
void solve(){
	int n;cin>>n;int a[n+1];int cnt1=0,cnt2=0;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+1+n);
	int l=a[1],r=a[n];
	if(l==r){
		cout<<n*1ll*(n-1)<<endl;
		return ;
	}
	for(int i=1;i<=n;i++){
		if(a[i]==l)cnt1++;
		else if(a[i]==r)cnt2++;
	}
	cout<<1ll*2*cnt1*cnt2<<endl;
}
int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
	int t;cin>>t;
	while(t--){
		solve();
	}
}

B. 根据右区间向左区间贪心
 

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+5;
ll n,m,nf[N];
void solve(){
	scanf("%lld%lld",&n,&m);
	memset(nf,0,sizeof(nf));
	for(int i=1;i<=m;i++){
		ll a,b;
		scanf("%lld%lld",&a,&b);
		if(a<b){
			nf[b]=max(nf[b],a);
		}else{
			nf[a]=max(nf[a],b);
		}
	}
	ll ans=0,now=0;
	for(int i=1;i<=n;i++){
		ll len=i-max(now,nf[i]);
		ans+=len;
		now=max(now,nf[i]);
	}
	printf("%lld\n",ans);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--){
		solve();
	}
}

C. 筛质因子 如果有一个质因子出现两次 就是YES

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define mkp make_pair
#define ll long long
#define sz(i) (int)(i).size()
#define mem(i,j) memset(i,j,sizeof(i))
#define rep(i,j,k) for(ll i=(j);i<=(k);i++)
const int N=2e5;
const int M=100010;
const int INF=0x3f3f3f3f;
const ll mod=998244353;
vector<int> v;
void solve(){
	int n;cin>>n;
	int a[n+1];
	for(int i=1;i<=n;i++)cin>>a[i];
	for(auto x:v){
		int cnt=0;
		for(int i=1;i<=n;i++){
			if(a[i]%x==0){
				cnt++;
				while(a[i]%x==0)
				a[i]/=x;
			}
		} 
		if(cnt>=2){
			cout<<"YES"<<endl;
			return ;
		}
	}
	set<int> s;map<int,int> mp; 
	for(int i=1;i<=n;i++){
		if(a[i]!=1)mp[a[i]]++;
		if(mp[a[i]]>=2){
			cout<<"YES"<<endl;
			return ;
		}
	}
	cout<<"NO"<<endl;
}
int main(){
	ios::sync_with_stdio(false);
    cin.tie(0);
	int t;cin>>t;
	while(t--){
		solve();
	}
}