bzoj1653 [Usaco2006 Feb]Backward Digit Sums

最新推荐文章于 2023-07-28 10:25:05 发布

原创最新推荐文章于 2023-07-28 10:25:05 发布 · 673 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

bzoj

本文介绍了一个复杂的数学游戏，玩家需要从最终的数字总和和给定的数字范围推断出初始序列。通过提供一个输入示例和详细解释，本文演示了解决该问题的方法，并通过代码实现帮助理解。此过程涉及到区间动态规划和选择最优序列以保持数值顺序的最小性。

Description

FJ and his cows enjoy playing a mental game. They write down the numbers from 1 to 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=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 N. 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.

Input

* Line 1: Two space-separated integers: N and the final sum.

Output

* Line 1: An ordering of the integers 1..N that leads to the given sum. If there are multiple solutions, choose the one that is lexicographically least, i.e., that puts smaller numbers first.

Sample Input

4 16

Sample Output

3 1 2 4

OUTPUT DETAILS:

There are other possible sequences, such as 3 2 1 4, but 3 1 2 4
is the lexicographically smallest.

简单的区间dp……好久没写i、j的顺序有点乱

#include<cstdio>
int n,a[2010];
int f[2010][2010];
inline int max(int a,int b)
{return a>b?a:b;}
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int main()
{
	n=read();
	for (int i=1;i<=n;i++)a[i]=read();
	for (int i=1;i<=n;i++)f[i][i]=n*a[i];
	for (int i=n;i>=1;i--)
	  for (int j=1;j<=n-i;j++)
	    f[i][i+j]=max(f[i+1][i+j]+a[i]*(n-j),f[i][i+j-1]+a[i+j]*(n-j));
	printf("%d",f[1][n]);
}