子序列
void max_sum(int a[], int n){
int this_sum, max_sum, best_i, best_j, i, j;
i = this_sum = max_sum = 0; best_i = best_j = -1;
for( j=0; j max_sum )
{ /* update max_sum, best_i, best_j */
max_sum = this_sum;
best_i = i;
best_j = j;
}
else if( this_sum [@more@]
原创
IT生活
694
2007-06-14 18:21