Beautiful Now (HDU 6351) (dfs + 剪枝，不能用贪心)

最新推荐文章于 2020-05-28 23:51:49 发布

lxt_Lucia

最新推荐文章于 2020-05-28 23:51:49 发布

阅读量380

点赞数 1

分类专栏： spiny 文章标签： dfs 搜索剪枝

本文链接：https://blog.csdn.net/lxt_lucia/article/details/89740025

版权

Given a positive integer, Anton wants to beautify it with up to k swaps of digits. The problem involves finding the minimum and maximum numbers achievable, avoiding leading zeros and proving that a greedy approach is incorrect. A depth-first search with pruning is suggested as a solution, where the maximum value may require exploring multiple possibilities for the largest trailing digits." 81324423,7828665,layui使用教程：列表数据更新功能实现,"['前端开发', 'JavaScript', 'HTML', 'layui']

摘要由CSDN通过智能技术生成

欢迎访问https://blog.csdn.net/lxt_Lucia～～

宇宙第一小仙女\(^o^)/～萌量爆表求带飞=≡Σ((( つ^o^)つ~ dalao们点个关注呗～

--------------------------------我只是一条可爱哒分界线-------------------------------

一、问题：

Description

Anton has a positive integer n, however, it quite looks like a mess, so he wants to make it beautiful after k swaps of digits.
Let the decimal representation of n as (x1x2⋯xm) satisfying that 1 ≤ x1 ≤ 9， 0 ≤ xi ≤ 9 ( 2 ≤ i ≤ m)，which means n = ∑ (i = 1 ~ i = m) xi * 10的 m−i 次方. In each swap, Anton can select two digits xi and xj (1 ≤ i ≤ j ≤ m ) and then swap them if the integer after this swap has no leading zero.
Could you please tell him the minimum integer and the maximum integer he can obtain after k swaps?