UNIMODAL PALINDROMIC DECOMPOSITIONS
| Time Limit: 1000MS | Memory Limit: 65536K | |
| Total Submissions: 5430 | Accepted: 2641 |
Description
A sequence of positive integers is Palindromic if it reads the same forward and backward. For example: 23 11 15 1 37 37 1 15 11 23 1 1 2 3 4 7 7 10 7 7 4 3 2 1 1 A Palindromic sequence is Unimodal Palindromic if the values do not decrease up to the middle value and then (since the sequence is palindromic) do not increase from the middle to the end For example, the first example sequence above is NOT Unimodal Palindromic while the second example is. A Unimodal Palindromic sequence is a Unimodal Palindromic Decomposition of an integer N, if the sum of the integers in the sequence is N. For example, all of the Unimodal Palindromic Decompositions of the first few integers are given below: 1: (1) 2: (2), (1 1) 3: (3), (1 1 1) 4: (4), (1 2 1), (2 2), (1 1 1 1) 5: (5), (1 3 1), (1 1 1 1 1) 6: (6), (1 4 1), (2 2 2), (1 1 2 1 1), (3 3), (1 2 2 1), ( 1 1 1 1 1 1) 7: (7), (1 5 1), (2 3 2), (1 1 3 1 1), (1 1 1 1 1 1 1) 8: (8), (1 6 1), (2 4 2), (1 1 4 1 1), (1 2 2 2 1), (1 1 1 2 1 1 1), ( 4 4), (1 3 3 1), (2 2 2 2), (1 1 2 2 1 1), (1 1 1 1 1 1 1 1) Write a program, which computes the number of Unimodal Palindromic Decompositions of an integer.
Input
Input consists of a sequence of positive integers, one per line ending with a 0 (zero) indicating the end.
Output
For each input value except the last, the output is a line containing the input value followed by a space, then the number of Unimodal Palindromic Decompositions of the input value. See the example on the next page.
Sample Input
2345678102324131213920
Sample Output
2 23 24 45 36 77 58 1110 1723 10424 199131 5010688213 105585259092 331143
题意：
给一个正整数，求出它的Unimodal Palindromic的个数，所谓的Unimodal Palindromic就是一系列数，单调递增再递减，并且第一个和最后一个数相同，第二个跟倒数第二个数相同，即第i个跟第n-i+1个数相同。
思路：
把它的Unimodal Palindromic分成两部分：一部分是最小数是j的，就是第一个跟最后一个数等于j的有几个；第二部分是最小数大于j的，可以是j+1，j+2…..的有几个。
dp[i][j]表示和为i，最小数是j的序列的个数。那么第一部分就是dp[i-j*2][j],
意思就是和为去掉了首尾两个数后的和，最小数是j；第二部分就是dp[i][j+1].最小数大于j的情况的个数。状态转移方程：
dp[i][j] = dp[i-2*j][j] + dp[i][j+1]
初始化：
①．dp[0][j]初始值1.因为当需要调用dp[0][j]时，表示拆成了两个相同的数。有一个
②．dp[i][j]（i<j< font="">）初始值0，不可能的情况
③．dp[i][j] (i>=j >i/2) 初始值1，j>i/2时所有s[i][j]都是1，那个就是i本身。
1 //2016.8.22 2 #include3 #include 4 #define ll long long 5 6 using namespace std; 7 8 const int N = 505; 9 ll dp[N][N];10 11 int main()12 {13 int n;14 memset(dp, 0, sizeof(dp));15 for(int i = 1; i < N; i++)16 dp[0][i] = 1;17 for(int i = 1; i < N; i++)18 for(int j = i/2+1; j <= i; j++)19 dp[i][j] = 1;20 for(int i = 2; i < N; i++)21 for(int j = i/2; j > 0; j--)22 dp[i][j] = dp[i-2*j][j]+dp[i][j+1];23 while(scanf("%d", &n)!=EOF && n)24 {25 printf("%d %lld\n", n, dp[n][1]);26 }27 28 return 0;29 }