acm训练

最新推荐文章于 2024-04-12 03:37:04 发布

Smi_l_e_

最新推荐文章于 2024-04-12 03:37:04 发布

阅读量315

点赞数

分类专栏：算法学习

本文链接：https://blog.youkuaiyun.com/Smi_l_e_/article/details/103963068

版权

给定一个长度为n的排列，允许最多进行n-1次相邻元素交换，任务是找到通过这些操作能得到的字典序最小的排列。题目提供了一些例子和解题思路。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B. Minimize the Permutation

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given a permutation of length n. Recall that the permutation is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2,3,1,5,4] is a permutation, but [1,2,2] is not a permutation (2 appears twice in the array) and [1,3,4] is also not a permutation (n=3 but there is 4 in the array).

You can perform at most n−1 operations with the given permutation (it is possible that you don’t perform any operations at all). The i-th operation allows you to swap elements of the given permutation on positions i and i+1. Each operation can be performed at most once. The operations can be performed in arbitrary order.

Your task is to find the lexicographically minimum possible permutation obtained by performing some of the given op