2020牛客多校 第五场 F DPS

题目

代码

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<cctype>
#include<ctime>
#include<iostream>
#include<string>
#include<map>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<iomanip>
#include<list>
#include<bitset>
#include<sstream>
#include<fstream>
#include<complex>
#include<algorithm>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#define int long long
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int a[110];
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
		int n;
		cin>>n;
		int maxn=0;
		for(int i=1;i<=n;i++) cin>>a[i],maxn=max(maxn,a[i]);
		for(int j=1;j<=n;j++){
			int m=50LL*a[j]/maxn+(50LL*a[j]%maxn!=0);
			cout<<"+";
			for(int i=1;i<=m;i++) cout<<"-";
			cout<<"+"<<endl;
			cout<<"|";
			for(int i=1;i<=m;i++){
				if(i==m&&a[j]==maxn) cout<<"*";
				else cout<<" ";
			}
			cout<<"|";
			cout<<a[j]<<endl;
			cout<<"+";
			for(int i=1;i<=m;i++) cout<<"-";
			cout<<"+"<<endl;	
		}
    return 0;
}