Submission

Score: 100

User: ei

Problemset: ภูเขา

Language: cpp

Time: 0.003 second

Submitted On: 2026-07-06 13:18:06

#include <bits/stdc++.h>
using namespace std;
signed main(){
    int n, mx=-1;
    cin>>n;
    int arr[n];
    for(auto&e:arr){
        cin>>e;
        mx = max(mx,e);
    }
    for(int i=0;i<mx;++i){
        for(auto&e:arr){
            if(mx-i > e){
                cout<<string(e*2, '.');
            }
            else cout<<string(mx-i-1,'.')<<string(1,'/')<<string((i-(mx-e))*2,'.')<<string(1,'\\')<<string(mx-i-1,'.');
        }
        cout<<'\n';
    }
}