Codeforces Round #764 (Div. 3) VP ABCD

A - Plus One on the Subset

直接求极差即可

#include 
#define int long long
using namespace std;
 
inline void solve(){
    int n = 0; cin >> n;
    int maxx = -1, minn = INT_MAX;
    for(int i = 1; i > x;
        maxx = max(maxx, x), minn = min(minn, x);
    }
    cout  a >> b >> c;
    if(a == b == c || b - a == c - b || a - b == b - c){ cout