Submission

Score: 100

User: APNICHANAN

Problemset: ภูเขา

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-12 14:39:33

#include <iostream>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int h[n], max = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> h[i];
        if (h[i] > max)
            max = h[i];
    }

    for (int i = max; i >= 1; i--)
    {
        for (int j = 0; j < n; j++)
        {
            if (h[j] >= i)
            {
                for (int k = 0; k < i - 1; k++)
                    cout << ".";
                cout << "/";
                for (int k = 0; k < 2 * (h[j] - i); k++)
                    cout << ".";
                cout << "\\";
                for (int k = 0; k < i - 1; k++)
                    cout << ".";
            }
            else
            {
                for (int k = 0; k < 2 * h[j]; k++)
                    cout << ".";
            }
        }
        cout << endl;
    }
}