POJ2279 线性dp

http://poj.org/problem?id=2279 学习思路，直接开空间会爆内存，开个动态的可还行。可是怎么开动态多维数组需要学习

  #include<cstdio>
 #include<iostream>
 #include<cstring>
 using namespace std;
 long long f[31][31][31][31][31];
 int main()
 {

     int n, i, j, k;
     int lim[6];
     while (cin >> n && n) {
         memset(f, 0, sizeof(f)); memset(lim, 0, sizeof(lim));
         for (i = 1; i <= n; i++)
             cin >> lim[i];
         f[0][0][0][0][0] = 1;
         for (i = 0; i <= lim[1]; i++)
             for (j = 0; j <= lim[2]; j++) {
                 //if (i <= j)continue;
                 for (k = 0; k <= lim[3]; k++) {
                     //if (j <= k)continue;
                     for (int a = 0; a <= lim[4]; a++) {
                         //if (k <= a)continue;
                         for (int b = 0; b <= lim[5]; b++) {
                             //if (a <= b)continue;
                             if (i + 1 <= lim[1])f[i + 1][j][k][a][b] += f[i][j][k][a][b];
                             if (j + 1 <= lim[2] && j < i)f[i][j + 1][k][a][b] += f[i][j][k][a][b];
                             if (k + 1 <= lim[3] && k < j&&k < i)f[i][j][k + 1][a][b] += f[i][j][k][a][b];
                             if (a + 1 <= lim[4] && a < i&&a < j&&a < k)f[i][j][k][a + 1][b] += f[i][j][k][a][b];
                             if (b + 1 <= lim[5] && b < i&&b < j&&b < k&&b < a)f[i][j][k][a][b + 1] += f[i][j][k][a][b];
                         }
                     }
                 }
             }
         cout << f[lim[1]][lim[2]][lim[3]][lim[4]][lim[5]] << endl;
     }
 
     return 0;
 }