F. DPS (思维) 2020牛客暑期多校训练营（第五场）

传送门

思路：

• 大概就是那么个意思，找到di的最大值maxi di，然后将每个di通过公式转换成si，再按照相应格式输出即可。
• 注意每个maxi di前的 ‘*’，以及公式中的上取整符合。

代码实现：

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 2e5 + 5;

int n, maxx, d[N], s[N];

signed main()
{
    IOS;

    cin >> n;
    for(int i = 0; i < n; i ++){
        cin >> d[i];
        maxx = max(d[i], maxx);
    }
    for(int i = 0; i < n; i ++){
        s[i] = 50LL * d[i] / maxx + (50LL * d[i] % maxx != 0);
        cout << "+";
        for(int j = 0; j < s[i]; j ++) cout << "-";
        cout << "+" << endl << "|";
        for(int j = 0; j < s[i] - 1; j ++) cout << " ";
        if(s[i]) cout << (d[i] == maxx ? "*" : " ");
        cout << "|" << d[i] << endl << "+";
        for(int j = 0; j < s[i]; j ++) cout << "-";
        cout << "+" << endl;
    }

    return 0;
}