uva 120 Stacks of Flapjacks

最新推荐文章于 2022-01-24 08:37:50 发布

循环是人递归是神

最新推荐文章于 2022-01-24 08:37:50 发布

阅读量171

点赞数

分类专栏： UVA

本文链接：https://blog.csdn.net/qq_35752161/article/details/106109131

版权

UVA 专栏收录该内容

30 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<algorithm>
#include<queue>
#include<cmath>
#include<math.h>
#include<string>
#include<string.h>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<set>
#include<stack>
#include<sstream>
//#include <Eigen/Dense>
//#include <Eigen/Geometry>
//using namespace Eigen;
using namespace std;

vector<int> a(100), b(100);
int cmp(int i, int j)
{
	return i > j;
}
int main()
{

	while (cin >> a[0])
	{
		int n = 1;
		b[0] = a[0];
		while (getchar() != '\n')
		{
			cin >> a[n++];
			b[n - 1] = a[n - 1];
		}
		for (int i = 0; i < n; i++)
			cout << a[i] << " ";
		cout << endl;
		sort(b.begin(), b.begin() + n, cmp);
		reverse(a.begin(), a.begin() + n);
		vector<int> ans;
		int k = 0;
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				if (a[j] == b[i])
				{
					if (j != k)
					{
						if (j != n - 1)
						{
							reverse(a.begin() + j, a.begin() + n);
							ans.push_back(j + 1);
						}
						reverse(a.begin() + k, a.begin() + n);
						ans.push_back(k + 1);		
					}
					k++;
					break;
				}
			}
		}
		for (int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << "0" << endl;
		
	}
	return 0;
}