杭电1171Big Event in HDU 皇星客栈

http://acm.hdu.edu.cn/showproblem.php?pid=1171

我错在这里把

int c1[max];
int c2[max];
int value[51];
int count[51];

放在main函数里面，结果导致stack overflow 栈溢出，但放在main函数外面作为全局变量就不会。这是因为函数的内存在开在栈上的，全局变量内存在堆上分配。前者远小于后者

#include<cstdio>
#include<cstring>

#define max 250010

int c1[max];
int c2[max];
int value[51];
int count[51];

int main( )
{
    int i;
    int j;
    int k;
    int sum;
    int n;
    int len;
    
    while( scanf("%d",&n)==1&&(n>0))
    {

        memset(value,0,sizeof(value));
        memset(count,0,sizeof(count));
        sum = 0;

        for( i = 1; i <= n; i++ )
        {
            scanf("%d %d",&value[i],&count[i]);
            sum += value[i]*count[i];
        }

        memset(c1,0,sum*sizeof(c1[1]));
        memset(c2,0,sum*sizeof(c1[1]));

        for( i = 0; i <= value[1]*count[1]; i += value[1] )  //此处赋初值要注意
        {
            c1[i] = 1;
        }
        
        len = count[1]*value[1];

        for( j = 2; j <= n; j++ )  //指向表达式
        {
            for( i = 0 ; i <= len; i++ ) //指向已经求了的表达式中每项
                for( k = 0; k <= value[j]*count[j]; k += value[j] )
                    c2[i+k] += c1[i];
                len += count[j]*value[j];
                for( k = 0; k <= len; k++ ) //更新表达式系数
                {
                    c1[k] = c2[k];
                    c2[k] = 0;
                }
         }
        for( j = sum/2; j >= 0; j-- )
        {
            
            if( c1[j] != 0 )
            {
                printf("%d %d\n",sum-j,j )                                        ;
                break;
            }
        }

    }
    return 0;
}