帮忙看看怎么优化
Aprin 2005-04-21 12:31:38 当n=20时,还勉强可以接受,再大一点就不行了,远没有到MAXN的要求,我不懂优化,谁能帮帮忙,谢谢!
#include <stdio.h>
#define MAXN 150
int sum(int data[], int head, int tail);
int best(int data[], int head, int tail) {
int temp1, temp2;
if(head==tail)
return head;
temp1= *(data+head)+sum(data, head+1, tail);
temp2= *(data+tail)+sum(data, head, tail-1);
return (temp1>temp2)?head:tail;/*返回指针*/
}
int sum(int data[], int head, int tail) {
int temp;
if(head==tail)
return 0;/*有0个数据*/
if(tail== head+1)
return (*(data+head)<*(data+tail))?head:tail;/*取小的那一个*/
if(best(data, head, tail)==head)
head++;
else tail--;
temp= best(data, head, tail);
if(temp==head)
return *(data+temp)+sum(data, head+1, tail);
else
return *(data+temp)+sum(data, head, tail-1);
}
int main(void) {
int data[MAXN], head, tail, n, i, total1, total2, temp;
scanf("%d", &n);
for(i=0; i<n; i++)
scanf("%d", data+i);
total1= total2= 0;
head=0;
tail= n-1;
for(i=0; i<n; i++) {
temp= best(data, head, tail);
if((i+1)%2!=0)
total1= total1+*(data+temp);
else
total2= total2+*(data+temp);
if(temp==head)
head= head+1;
else
tail= tail-1;
}
printf("%d %d\n", total1, total2);
getch();
return 0;
}