Codeforces 1154 - A/B/C/D/E/F/G - (Undone)

链接：https://codeforces.com/contest/1154

---

A - Restoring Three Numbers - [水]

#include<bits/stdc++.h>
using namespace std;

int a[];
int main()
{
    cin>>a[]>>a[]>>a[]>>a[];
    sort(a,a+);
    for(int i=;i<=;i++) printf("%d ",a[]-a[i]);
}

---

B - Make Them Equal - [分类讨论]

#include<bits/stdc++.h>
using namespace std;
const int maxn=;
int n;
int a[maxn];
bool vis[maxn];

bool check(int x,int p)
{
    for(int i=;i<=n;i++)
    {
        if(a[i]+x==p || a[i]==p || a[i]-x==p) continue;
        return ;
    }
    return ;
}
int main()
{
    cin>>n;

    int cnt=;
    for(int i=;i<=n;i++)
    {
        cin>>a[i];
        if(!vis[a[i]]) vis[a[i]]=, cnt++;
    }

    if(cnt==){printf("0\n"); return ;}

    if(cnt==)
    {
        int min1=, min2=;
        for(int x=;x<=;x++)
        {
            if(vis[x])
            {
                if(min1==) min1=x;
                else if(min2==) min2=x;
                else break;
            }
        }
        int D;
        if((min2-min1)%==) D=(min2-min1)/;
        else D=min2-min1;
        cout<<D<<endl;
        return ;
    }

    int min1=, min2=, min3=;
    for(int x=;x<=;x++)
    {
        if(vis[x])
        {
            if(min1==) min1=x;
            else if(min2==) min2=x;
            else if(min3==) min3=x;
            else break;
        }
    }
    if(min3-min2==min2-min1)
    {
        int D=min3-min2;
        if(check(D,min2)) cout<<D<<endl;
        else cout<<-<<endl;
    }
    else cout<<-<<endl;
}

---

C - Gourmet Cat

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll a,b,c;
ll run(int st)
{
    ll A=a, B=b, C=c;
    for(int i=st;i<=;i++)
    {
        if(i== || i== || i==)
        {
            if(A>) A--;
            else return i-st;
        }
        else if(i== || i==)
        {
            if(B>) B--;
            else return i-st;
        }
        else if(i== || i==)
        {
            if(C>) C--;
            else return i-st;
        }
    }
    ll ans=-st+;
    ll num=min(min(A/,B/),C/);
    ans+=num*;
    A-=*num, B-=*num, C-=*num;
    for(int i=;;i++)
    {
        if(i== || i== || i==)
        {
            if(A>) A--;
            else return ans+i-;
        }
        else if(i== || i==)
        {
            if(B>) B--;
            else return ans+i-;
        }
        else if(i== || i==)
        {
            if(C>) C--;
            else return ans+i-;
        }
    }
}
int main()
{
    cin>>a>>b>>c;
    ll ans=;
    for(int st=;st<=;st++)
    {
        ll res=run(st);
        //printf("%d: %I64d\n",st,res);
        ans=max(ans,res);
    }
    cout<<ans<<endl;
}

---

D - Walking Robot - [贪心]

---

E - Two Teams - [线段树+链表]

---

F - Shovels Shop - [DP]

---

G - Minimum Possible LCM - (Undone)