200706

[lsy0314]

https://level.goorm.io/exam/43211/다익스트라-알고리즘-dijkstra-s-algorithm/quiz/1

#include<stdio.h>
int main() {
int n,i,j,t[100],data[100][1000],a,b=0,c=0;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &t[i]);
for (j = 0; j < t[i]; j++) {
scanf("%d", &data[i][j]);
}
}
for (i = 0; i < n; i++) {
b = 0;
c = 0;
for (j = 0; j < t[i]-1; j++) {
if (data[i][j] > data[i][j + 1]) {
a = data[i][j] - data[i][j + 1];
if (a > c)
c = a;
}
else if (data[i][j] == data[i][j + 1])
a = 0;
else {
a = data[i][j + 1] - data[i][j];
if (a > b)
b = a;
}
}
printf("#%d %d %d", i+1, b, c);
printf(" \n");
}
}