牛客多校(2020第五场)F DPS

题目链接：https://ac.nowcoder.com/acm/contest/5670/F

题解：注意爆int，需注意double精度问题，向上取整

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

const long long  MAX_N = 1000;

long long n;
long long s;

long long col_s(long long  mx, long long  di) {
   return (50 * di + mx - 1) * 1.0/ mx;
}

void out_print (long long  length, long long  di, long long  max) {
    cout << "+";
    for (long long  i = 0; i < length; i++) {
        cout << "-";
    }
    cout << "+
";
    cout << "|";
    for (long long  i = 0; i < length-1; i++) {
        cout << " ";
    }
    if(di == max)
        cout << "*|" << di << "
";
    else if (di == 0) 
        cout << "|" << di << "
";
    else
        cout << " |" << di << "
";
    cout << "+";
    for (long long  i = 0; i < length; i++) {
        cout << "-";
    }
    cout << "+
";
}

int main() {
    cin >> n;
    long long  a[MAX_N];
    long long  max_num = 0;
    for (long long  i = 0; i < n; i++) {
        cin >> a[i];
        if (max_num < a[i]) max_num = a[i];
    }
    for (long long  i = 0; i < n; i++) {
        long long  length = col_s(max_num, a[i]);
        out_print (length, a[i], max_num);
    }
    return 0;
}