超级矿工 完全攻略

问题描述：

以下程序需要在DSP中运行，但是只有10K全局mem，
大数组数据是程序生成固定的，请问如何压缩这个数组，才能够在10K全局mem中运行？

下面由于百杜限定粘贴字数，因此省略了一些数组数据

谢谢！

main()
{
int i;
int _maxSchedule = 41502;
int _toSchedule[41502] =
{
2,3,4,5,7,9,11,4,5,7,
9,10,11,12,7,8,9,10,11,12,
0,1,2,3,4,5,6,7,8,9,
10,11,12,13,0,1,2,3,4,5,

2,3,4,5,6,13,0,1,2,3,
4,5,6,13,0,1,2,3,4,5,
6,13,0,1,2,3,4,5,6,13,
0,1,2,3,4,5,6,13,0,1,
2,3,4,5,6,13,0,1,2,3,
4,5,6,13,0,1,2,3,4,5,
6,13,0,1,2,3,4,5,6,13,
0,1,2,3,4,5,6,13,0,1,
2,3,4,5,6,13,0,1,2,3,
4,5,6,13,0,1,2,3,4,5,
6,13,0,1,2,3,4,5,6,13,
0,1,2,3,4,5,6,13,0,1,
2,3,4,5,6,13,0,1,2,3,
4,5,6,13,0,1,2,3,4,5,
6,13,0,1,2,3,4,5,6,13,
14,15,0,1,2,3,4,5,6,13,
0,1,2,3,4,5,6,13,0,1,
2,3,4,5,6,13,0,1,2,3,
............
};
for(i=0;i<_maxSchedule; i++){
if(i%10==0)printf("\n");
printf("%i ", _toSchedule[i]);
}
}

问题解答：

怎么都没人回答