제출 #734076

#제출 시각아이디문제언어결과실행 시간메모리
734076AmaarsaaPancake (NOI12_pancake)C++14
12 / 25
1072 ms212 KiB
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
ll n, ans, p, j, s;
void Dfs(ll a[], ll  moves) {
	if ( moves < ans) return;
	if ( moves == 0) return ;
	s = n;
	
	for (ll i = 1; i <= n; i ++) {
		if ( a[i] == (n - i + 1)) s --;
	}
	if ( s == 0) {
		ans =max (ans, moves);
		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 = -1e9;
		ll a[n + 2];
		vector < pair < ll, ll > > v;
		for (i = 1; i <= n; i ++) {
			cin >> a[i];
			v.push_back(make_pair(a[i], i));
		}
		sort (v.begin(), v.end());
		for ( i = 0; i < n; i ++) {
			a[v[i].second ] = i + 1;
		}
		Dfs(a, 2*n);
		cout << 2 * n - ans << endl;
	}
}

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

pancake.cpp: In function 'int main()':
pancake.cpp:26:11: warning: unused variable 'r' [-Wunused-variable]
   26 |  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...