Submission

Score: 100

User: Dark_kingdom

Problemset: ภูเขา

Language: cpp

Time: 0.005 second

Submitted On: 2026-10-15 22:43:24

#include <iostream>
using namespace std;

int main()
{
	int n;
	cin>>n;
	int arr[n];
	int row = 0, hcol = 0;
	for(int i = 0; i<n; i++)
	{
		cin>>arr[i];
		if(arr[i]>row)
		{
			row = arr[i];
		}
		//hcol+=arr[i];
	}
	//int col = hcol*2;
	
	for(int i = 0; i<row; i++)
	{
		int lim_h = row-i;
		for(int j = 0; j<n; j++)
		{
			for(int k = 0; k<arr[j]*2; k++)
			{
				if(arr[j]<lim_h)
				{
					cout<<'.';
				}
				
				else
				{
					if(k !=row-1-i && k!=arr[j]*2-row+i)
					{
						cout<<'.';
					}
					else if(k==row-1-i)
					{
						cout<<'/';
					}
					else
					{
						cout<<'\\';
					}
				}
				
			}
		}
		cout<<"\n";
	}
	return 0;
}