洛谷P1118 [USACO06FEB]数字三角形 Backward Digit Su（dfs剪枝）

最新推荐文章于 2022-03-08 21:35:49 发布

Low丶Coder

最新推荐文章于 2022-03-08 21:35:49 发布

阅读量234

点赞数

分类专栏： DFS

本文链接：https://blog.csdn.net/sinat_37158899/article/details/82631971

版权

本文介绍了一个关于数字游戏的编程问题，玩家从1到N的排列开始，每次将相邻数字相加直到只剩一个数字。游戏的目标是从最终的总和反推出原始排列，要求输出字典序最小的排列。提供了输入输出格式、样例和解决方案，其中解决方案使用了DFS并进行了剪枝优化。

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

题目描述

FJ and his cows enjoy playing a mental game. They write down the numbers from 11 toN(1 \le N \le 10)N(1≤N≤10) in a certain order and then sum adjacent numbers to produce a new list with one fewer number. They repeat this until only a single number is left. For example, one instance of the game (when N=4N=4) might go like this:

    3   1   2   4
      4   3   6
        7   9
         16

Behind FJ's back, the cows have started playing a more difficult game, in which they try to determine the starting sequence from only the final total and the number NN. Unfortunately, the game is a bit above FJ's mental arithmetic capabilities.

Write a program to help FJ play the game and keep up with the cows.

有这么一个游戏：

写出一个11至NN的排列a_iai，然后每次将相邻两个数相加，构成新的序列，再对新序列进行这样的操作，显然每次构成的序列都比上一次的序列长度少11，直到只剩下一个数字位置。下面是一个