第十六次CCF计算机软件能力认证

1、小中大

ACwing 3272

#include <iostream>
#include <algorithm>
using namespace std;

const int N = 1e5 + 10;

int n;
int a[N];

int main() {
   
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    cout << max(a[0], a[n - 1]) << " ";
    if (n & 1) cout << a[n / 2] << " ";
    else {
   
        int s = a[n / 2] + a[n / 2 - 1];
        if (s % 2) printf("%.1f ", (double) (a[n / 2] + a[n / 2 - 1]) / 2);
        else cout << s / 2 << " ";
    }
    cout << min(a[0], a[n - 1]) << endl;
    return 0;
}

2、二十四点

ACwing 3273

#include <iostream>
#include <algorithm>
#include <stack>
#include <unordered_map>
using namespace std;

stack<int> num;
stack<char<