백준 [ALGORITHM] - 바구니 뒤집기 (10811)

#include <stdio.h>
int revlst(int lst[], int a, int b) {
    a = a-1;
    b = b-1;
    while(a < b) {
        int temp = lst[a];
        lst[a] = lst[b];
        lst[b] = temp;
        a++;
        b--;
    }
}

int main() {
    int n, m;
    int a, b;

    scanf("%d %d", &n, &m);
    int lst[n];

    for (int i = 0; i<n; i++) {
        lst[i] = i+1;
    }

    for (int i = 0; i<m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        revlst(lst, a, b);
    }
    
    for (int i = 0; i<n; i++) {
        printf("%d ",lst[i]);
    }

}