Submission

[PPPPPPPPP]

Score: 100

User: Spongebob

Problemset: ภูเขา

Language: c

Time: 0.001 second

Submitted On: 2024-10-17 00:56:00

/*
#include <stdio.h>

int main () {
    int N;
    scanf("%d", &N);
    int arr[N], i, j, h_max = -1, k;
    for (i = 0; i < N; i++) {
        scanf("%d", &arr[i]);
        h_max = (arr[i] > h_max) ? arr[i] : h_max;
    }
    
    for (i = h_max-1; i >= 0; i--) {
        for (j = 0; j < N; j++) {
            if (i >= arr[j]) {
               for (k = 0; k < arr[j]*2; k++) {
                   printf(" ");
                }
                continue;
            }
            // space
            for (k = 0; k < arr[j] - ((arr[j] - 1 - i) + 1); k++) {
                printf(" ");
            }
            // \ 
            printf("/");
            // space
            for (k = 0; k < (arr[j] - 1 - i)*2; k++) {
                printf(" ");
            }
            // /
            printf("\\");
            // space
            for (k = 0; k < arr[j] - ((arr[j] - 1 - i) + 1); k++) {
                printf(" ");
            }
        }
        
        
        printf("\n");
    }
    
    return 0;
}
*/
/*
#include <stdio.h>

int main () {
    int N, offset = 0;
    scanf("%d", &N);
    int arr[N], i, j, h_max = -1, k, width = 0;
    for (i = 0; i < N; i++) {
        scanf("%d", &arr[i]);
        h_max = (arr[i] > h_max) ? arr[i] : h_max;
        width += arr[i]*2;
    }
    
    char grid[h_max][width+1];
    
    for (i = 0; i < h_max; i++) {
        for (j = 0; j < width; j++) {
            grid[i][j] = ' ';
        }
        grid[i][width] = '\0';
    }
    
    for (i = 0; i < h_max; i++) {
        offset = 0;
        for (j = 0; j < N; j++) {
            if (i >= arr[j]) {offset += arr[j]*2;continue;}
            grid[h_max - 1 - i][i+offset] = '/';
            grid[h_max - 1 - i][-i+offset+arr[j]*2-1] = '\\';
            offset += arr[j]*2;
        }
    }
    
    for (i = 0; i < h_max; i++) {
        printf("%s\n", grid[i]);
    }
    
    return 0;
}
*/

#include <stdio.h>

int main () {
    int N;
    scanf("%d", &N);
    int h_mount[N];
    int h_max = -1;
    int i, j, k;
    for (i = 0; i < N; i++) {
        scanf("%d", &h_mount[i]);
        h_max = (h_mount[i] > h_max) ? h_mount[i]: h_max;
    }
    
    for (i = 0; i < h_max; i++) {
        for (j = 0; j < N; j++) {
            if (h_max-i > h_mount[j]) {
               for (k = 0; k < h_mount[j]*2; k++) {
                   printf(".");
               }
               continue;
            }
            for (k = 0; k < (h_mount[j]*2-((h_mount[j]-(h_max-i))*2+2))/2; k++) {
                printf(".");
            }
            printf("/");
            for (k = 0; k < (h_mount[j]-(h_max-i))*2; k++) {
                printf(".");
            }
            printf("\\");
            for (k = 0; k < (h_mount[j]*2-((h_mount[j]-(h_max-i))*2+2))/2; k++) {
                printf(".");
            }
        }
        printf("\n");
    }
    
    return 0;
}