[Usaco2006 Feb]Backward Digit Sums
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 447 Solved: 312
[Submit][Status][Discuss]
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.
题意是求一个 1->n 的排列,使得由递推公式 f[i] = f[i]+f[i+1] 得到的最后一个f[1]==m
如果想用简便的方式,<algorithm>里面有一个鬼畜的函数
当然,想我这种站在逼格顶端的男人,必然要手写逆康托展开
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<iomanip>
using namespace std;
int main()
{
int n,m;
int jie[20],a[20],f[20];
bool book[20];
scanf("%d%d",&n,&m);
jie[1]=jie[0]=1;
for(int i=2;i<=n;i++)jie[i]=jie[i-1]*i;
int now=0;
while(jie[n]--)
{
int temp=now;
memset(book,0,sizeof(book));
for(int i=n-1;i>=0;i--)
{
int k=temp/jie[i],tot=0;
for(int j=1;j<=n;j++)
{
if(!book[j])tot++;
if(tot==k+1)
{a[n-i]=j;book[j]=1;break;}
}temp%=jie[i];
}
for(int i=1;i<=n;i++)f[i]=a[i];
for(int i=1;i<=n;i++)
for(int j=1;j<=n-i;j++)
f[j]=f[j]+f[j+1];
//cout<<f[1]<<endl;
if(f[1]==m)
{
for(int i=1;i<=n-1;i++)
printf("%d ",a[i]);printf("%d\n",a[n]);
return 0;
}
now++;
}
}