C语言实现相邻名次成绩差异最大值计算 - O(n)时间复杂度

#include <stdio.h>

int fun(int D[], int N) { if(N < 2) { return 0; }

int max_diff = 0;
int max_val = D[0];

for(int i = 1; i < N; i++) {
    if(D[i] > max_val) {
        max_val = D[i];
    } else {
        int diff = max_val - D[i];
        if(diff > max_diff) {
            max_diff = diff;
        }
    }
}

return max_diff;

}

int main() { int N; scanf("%d", &N);

int D[N];
for(int i = 0; i < N; i++) {
    scanf("%d", &D[i]);
}

int result = fun(D, N);
printf("%d\n", result);

return 0;

}