10811번: 바구니 뒤집기

#include<cstdio>

#include<algorithm>

int main()

{

int bgn[101], n, m;

scanf("%d %d", &n, &m);

for (int i = 1; i <= n; ++i)

bgn[i] = i;

for (int i = 0, s, f; i < m; ++i)

{

scanf("%d %d", &s, &f);

std::reverse(&bgn[s], &bgn[f+1]);

}

for (int i = 1; i <= n; ++i)

printf("%d ", bgn[i]);

}