C++博客-lzmagic-随笔分类-递归http://www.cppblog.com/lzmagic/category/8565.html1/4桶水荡漾zh-cnSun, 26 Oct 2008 00:46:21 GMTSun, 26 Oct 2008 00:46:21 GMT60出栈次序问题http://www.cppblog.com/lzmagic/archive/2008/04/27/48258.htmllzmagiclzmagicSun, 27 Apr 2008 06:56:00 GMThttp://www.cppblog.com/lzmagic/archive/2008/04/27/48258.htmlhttp://www.cppblog.com/lzmagic/comments/48258.htmlhttp://www.cppblog.com/lzmagic/archive/2008/04/27/48258.html#Feedback0http://www.cppblog.com/lzmagic/comments/commentRss/48258.htmlhttp://www.cppblog.com/lzmagic/services/trackbacks/48258.htmlDescription

栈是常用的一种数据结构，有n个元素在栈顶端一侧等待进栈，栈顶端另一侧是出栈序列。你已经知道栈的操作有两种：push和pop，前者是将一个元素进栈，后者是将栈顶元素弹出。现在要使用这两种操作，由一个操作序列可以得到一系列的输出序列。请你编程求出对于给定的n，计算并输出由操作数序列1，2，…，n，经过一系列操作可能得到的输出序列总数。

Input

就一个数n(0<n<20)。

Output

一个数，即可能输出序列的总数目。

Sample Input 

3

Sample Output 

5
Solution 1st:
a[i][j] renotes the possible number of the previous j sequences with n = i
(we set a[k][0] = 1 (0 < k <= n), which implies NULL is thought of one possible sequence)
we init that a[1][1] = a[1][0] = 1;
yeild:
a[i][0] = a[i - 1][0];
a[i][j] = a[i][j - 1] + a[i - 1][j]; (1 <= j <= i - 1)
a[i][i] = a[i][i - 1];
the answer wo want to get is a[n][n].


 1#include<iostream>
 2using namespace std;
 3
 4#define MAXN 20
 5
 6int main()
 7{
 8    // init
 9    int a[MAXN][MAXN];
10    a[1][1] = a[1][0] = 1;
11
12    // input the total number pushed into the stack(0 < n && n < 20)
13    int n, i, j;
14    cin >> n;
15
16    // run
17    for(i = 2; i <= n; i++)
18    {
19        a[i][0] = a[i - 1][0];
20        for(j = 1; j <= i - 1; j++)
21        {
22            a[i][j] = a[i][j - 1] + a[i - 1][j];
23        }
24        a[i][j] = a[i][j - 1];
25    }
26
27    // ouput the number of possible sequences poped from the stack
28    cout << a[n][n] << endl;
29    
30    return 0;
31}




Solution 2nd:



denote a[n] the number of possible sequences poped from the stack,


denote i the number of the set si poped before the first number pushed '1' poped, 


and denote i the number of the set sj poped after the first number pushed '1' poped,


then we can easily get the conlusion that no number in seti is bigger than any number in setj,


we can depart the sequence into two part and caculate them respectively,


hence the possible number is a[i] * a[j] (0 <= i <= n - 1), i.e.


      a[n] = a[0]*a[n - 1] + a[1]*a[n - 2] + …… + a[n - 2]*a[1] + a[n - 1]*a[0]




 1#include<iostream>
 2using namespace std;
 3
 4#define MAXN 20
 5
 6int main()
 7{
 8    int a[MAXN];
 9    a[0] = 1;
10    int n, i, j;
11    cin >> n;
12    for(i = 1; i <= n; i++)
13    {
14        for(a[i] = 0, j = 0; j < i; j++)
15            a[i] += a[j] * a[i - 1 - j];
16    }
17    for(i = 1; i <= n; i++)
18        cout << "a[" << i << "] = " << a[i] << endl;
19    return 0;
20}




Solution 3id:

This is Catalan Number :
      a[n] = a[0]*a[n - 1] + a[1]*a[n - 2] + …… + a[n - 2]*a[1] + a[n - 1]*a[0]
      a[n] = C(n , 2 * n) / (n + 1)



lzmagic 2008-04-27 14:56 发表评论
]]>正整数划分问题http://www.cppblog.com/lzmagic/archive/2008/04/12/46900.htmllzmagiclzmagicSat, 12 Apr 2008 03:01:00 GMThttp://www.cppblog.com/lzmagic/archive/2008/04/12/46900.htmlhttp://www.cppblog.com/lzmagic/comments/46900.htmlhttp://www.cppblog.com/lzmagic/archive/2008/04/12/46900.html#Feedback0http://www.cppblog.com/lzmagic/comments/commentRss/46900.htmlhttp://www.cppblog.com/lzmagic/services/trackbacks/46900.html * 正整数划分问题：
 * 将正整数n表示成一系列正整数之和，n = n1 + n2 +……+ nk (n1 >= n2 >=……>= nk >= 1, k >= 1) 
 * 正整数n的这种表示称为正整数n的划分。
 * 求正整数n的不同划分数pn。
 * Input: n  (End with 0)
 * Ouput: pn (in each line)
 */



 1// Sulotion 1st:
 2#include<iostream>
 3using namespace std;
 4
 5int Count(int n, int m)
 6{
 7     if(m == 1) return 1;
 8    if(n <  m) return Count(n, n);
 9    if(n == m) return 1 + Count(n, m - 1);
10    if(n >  m) return Count(n - m, m) + Count(n, m - 1);
11}
12
13int main()
14{
15    int n;
16    cin >> n;
17    while(n != 0)
18    {
19        cout << Count(n, n) << endl;
20        cin >> n;
21    }
22
23    return 0;
24}




 1// Solution 2nd:
 2#include<iostream>
 3using namespace std;
 4
 5#define MAXN 100
 6
 7int main()
 8{
 9    int n, a[MAXN][MAXN], max, i, j;
10
11    // 初始值
12    a[1][1] = 1;
13    max = 1;
14
15    cin >> n;
16    while(n != 0)
17    {
18        if(n > max)
19        {
20            for(i = max + 1; i <= n; i++)
21            {
22                a[i][1] = a[i - 1][1];
23                for(j = 2; j <= i / 2; j++)
24                    a[i][j] = a[i - j][j] + a[i][j - 1];
25                for(; j <= i - 1; j++)
26                    a[i][j] = a[i - j][i - j] + a[i][j - 1];
27                a[i][j] = 1 + a[i][j - 1];
28            }
29            max = n;
30        }
31        cout << a[n][n] << endl;
32        cin >> n;
33    }
34    return 0;
35}



lzmagic 2008-04-12 11:01 发表评论
]]>