제출 #734226

#제출 시각아이디문제언어결과실행 시간메모리
734226Amaarsaa팬케이크 정렬 (NOI12_pancake)C++14
20 / 25
1064 ms212 KiB
#include<bits/stdc++.h>
 
using namespace std;
using ll = int;
ll n, ans, p, j, s;
void Dfs(ll a[], ll  moves) {
	if ( moves >= ans) return;
	s = 0;
	for (ll i = 1; i < n; i ++) {
		if ( a[i] <=a[i + 1]) s = 1;
	}
	if ( s == 0) {
		
		ans = min(moves, ans);
		return;
	}
	for (ll i = 1; i <= n; i ++) {
		reverse(a + i,a +n + 1);
		Dfs(a, moves + 1);
		reverse(a + i, a + n + 1);
	}
	return ;
}
int main() {
	ll i, t, r;
	cin >> t;
	
	while ( t --) {
		cin >> n;
		ans = 2 * n;
		ans = min(ans, 7);
		ll a[n + 2];
		for (i = 1; i <= n; i ++) {
			cin >> a[i];
		}
		Dfs(a, 0);
		cout <<ans << endl;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

pancake.cpp: In function 'int main()':
pancake.cpp:25:11: warning: unused variable 'r' [-Wunused-variable]
   25 |  ll i, t, r;
      |           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...