[알고리즘] 백준 10972번: 다음순열 - C++

www.acmicpc.net/problem/10972

10972번: 다음 순열

#include <cstdio>
#include <algorithm>
using namespace std;

int main() {
	int N;
	int *a;
	int i, j;
	scanf("%d", &N);
	a = (int *)malloc(sizeof(int)*N);
	for (int k = 0; k < N; k++) {
		scanf("%d", &a[k]);
	}
	i = N;
	while (i--) {
		if(i < 1) {
			printf("%d", --i);
			return 0;
		}
		else if (a[i - 1] < a[i]) break;
		else /* Do nothing */;
	}
	j = N;
	while (j--) {
		if (a[i - 1] < a[j]) {
			swap(a[i - 1], a[j]);
			break;
		}
	}

	j = N - 1;
	while (i <= j) {
		swap(a[i], a[j]);
		i++;
		j--;
	}
	for (int k = 0; k < N; k++) {
		printf("%d ", a[k]);
	}
	return 0;
}

 

github: github.com/waves123/10972/blob/master/10972/10972.cpp