题目链接

题面：

题意：
简单模拟。

题解：
简单模拟。

代码：

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#include<bitset>
#include<map>
#include<unordered_map>
#include<set>
#include<list>
#include<ctime>
#define ui unsigned int
#define ll long long
#define llu unsigned ll
#define ld long double
#define pr make_pair
#define pb push_back
#define lc (cnt<<1)
#define rc (cnt<<1|1)
#define len(x) (t[(x)].r-t[(x)].l+1)
#define tmid ((l+r)>>1)
#define max(x,y) ((x)>(y)?(x):(y))
#define min(x,y) ((x)>(y)?(y):(x))
using namespace std;

const int inf=0x3f3f3f3f;
const ll lnf=0x3f3f3f3f3f3f3f3f;
const double dnf=1e18;
const int mod=1e9+7;
const double eps=1e-1;
const double pi=acos(-1.0);
const int hp=13331;
const int maxn=200100;
const int maxp=400100;
const int maxm=600100;
const int up=200000;


ll d[maxn];
ll s[maxn];

int main(void)
{
    int n;
    scanf("%d",&n);
    ll maxx=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&d[i]);
        maxx=max(maxx,d[i]);
    }
    for(int i=1;i<=n;i++)
    {
        s[i]=50*d[i]/maxx+(50*d[i]%maxx!=0);

    }
    for(int i=1;i<=n;i++)
    {
        putchar('+');
        for(int j=1;j<=s[i];j++) putchar('-');
        putchar('+');
        putchar('\n');
        if(maxx==d[i])
        {
            putchar('|');
            for(int j=1;j<s[i];j++) putchar(' ');
            putchar('*');
            putchar('|');
            printf("%lld\n",d[i]);
        }
        else
        {
            putchar('|');
            for(int j=1;j<=s[i];j++) putchar(' ');
            putchar('|');
            printf("%lld\n",d[i]);
        }
        putchar('+');
        for(int j=1;j<=s[i];j++) putchar('-');
        putchar('+');
        putchar('\n');

    }

    return 0;
}