codeforces#510.div2

A. Benches

题目：求最小的最大值以及最大的最大值

分析：最大的最大值一定是最大的ai+m（易得）

最小的最大值分两种情况：

1.sum>=m(sum为ai相较于最大的ai的差值和)，此时最小的最大值为当前ai的最大值

2.sum<m，此时最小的最大值为（m-sum）/n+ai的最大值+1or（m-sum）/n+ai的最大值（将差值填满后平分）

#include<bits/stdc++.h>
using namespace std;
bool cmp(int a,int b)
{
    return a>b;
}
int main()
{
    int n;
    int m;
    cin>>n>>m;
    int a[105];
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1,cmp);
    int sum=0;
    for(int i=2;i<=n;i++)
    {
        sum+=a[1]-a[i];
    }
    if(sum>=m)
        cout<<a[1]<<" "<<a[1]+m<<endl;
    else
    {
      int mm=m-sum;
      if(n>=m)
        cout<<a[1]+1<<" "<<a[1]+m<<endl;
      else if(mm%n!=0)
        cout<<a[1]+mm/n+1<<" "<<a[1]+m<<endl;
      else
        cout<<a[1]+mm/n<<" "<<a[1]+m<<endl;
    }
}

B. Vitamins

水题，记录后遍历所有组合即可

#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
#define clr(a) memset(a,0,sizeof(a))
#define line cout<<"-----------------"<<endl;
 
typedef long long ll;
const int maxn = 1e5+10;
const int MAXN = 1e6+10;
const int INF = 1e8;
const int MOD = 1e9+7;
const int N = 1010;
 
int n;
 
 
int main(){
    while(scanf("%d", &n) != EOF){
        int v;
        string s;
        map<string, int> mp;
        mp["A"] = INF;
        mp["B"] = INF;
        mp["C"] = INF;
        mp["AB"] = INF;
        mp["AC"] = INF;
        mp["BC"] = INF;
        mp["ABC"] = INF;
        for(int i=0; i<n; i++){
            scanf("%d ", &v);
            cin >> s;
            sort(s.begin(), s.end());
            mp[s] = min(mp[s], v);
        }
        int ans = INF;
        ans = min(mp["A"] + mp["B"] + mp["C"], ans);
        ans = min(mp["A"] + mp["BC"], ans);
        ans = min(mp["B"] + mp["AC"], ans);
        ans = min(mp["C"] + mp["AB"], ans);
        ans = min(mp["AB"] + mp["AC"], ans);
        ans = min(mp["BC"] + mp["AC"], ans);
        ans = min(mp["AB"] + mp["BC"], ans);
        ans = min(mp["ABC"], ans);
        if(ans < 0 || ans >= INF) ans = -1;
        cout << ans << endl;
    }
    return 0;
}

C. Array Product

不难，但是不太好写，大约分7种情况讨论，情况考虑全了也就过了

#include<iostream>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<set>
#include<queue>
#include<map>
#include<cmath>
#include<string>
#include<cstring>
#include<ctime>
#include<fstream>
#include<cstdlib>
#include<algorithm>
 
using namespace std;
 
#define pii pair<int, int>
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define per(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,a,b) for(int i=a;i>=b;i--)
#define all(x) x.begin(),x.end()
#define PER(i,x) for(auto i=x.begin();i!=x.end();i++)
#define PI acos(-1.0)
#define inf 0x3f3f3f3f
typedef long long ll;
const double eps=1.0e-5;
const int maxn=200000+10;
 
int cnt1=0,cnt2=0,cnt3=0,n,tmp,ma=-inf,flag,a[maxn],b[maxn],c[maxn];
 
int main()
{
	//freopen("C:\\Users\\MAC\\Desktop\\in.txt","r",stdin);
	scanf("%d",&n);
	per(i,1,n){
		scanf("%d",&tmp);
		if(tmp<0){
			cnt1++;a[cnt1]=i;
			if(tmp>ma){ma=tmp;flag=i;}
		}
		else if(tmp==0) cnt2++,b[cnt2]=i;
		else cnt3++,c[cnt3]=i;
	}
	
	per(i,1,cnt3-1) printf("1 %d %d\n",c[i],c[i+1]);
	if(cnt1){
		if(cnt1%2){
			per(i,1,cnt1-1){
				if(a[i]==flag) continue;
				if(a[i+1]==flag) a[i+1]=a[i];
				else printf("1 %d %d\n",a[i],a[i+1]);
			}
			per(i,1,cnt2) printf("1 %d %d\n",flag,b[i]),flag=b[i];
			if(cnt3||cnt1>1)printf("2 %d\n",cnt2?b[cnt2]:flag);
			if(cnt3&&cnt1>1) printf("1 %d %d\n",a[cnt1],c[cnt3]);
		}else{
			per(i,1,cnt2-1) printf("1 %d %d\n",b[i],b[i+1]);
			per(i,1,cnt1-1) printf("1 %d %d\n",a[i],a[i+1]);
			if(cnt2) printf("2 %d\n",b[cnt2]);
			if(cnt3) printf("1 %d %d\n",a[cnt1],c[cnt3]);
		}
	}else{
		per(i,1,cnt2-1) printf("1 %d %d\n",b[i],b[i+1]);
		if(cnt2&&cnt3) printf("2 %d\n",b[cnt2]);
	}
 
}