******** fig2.6 **********

	int
	max_subsequence_sum( int a[], unsigned int n )
	{
		int this_sum, max_sum, best_i, best_j, i, j, k;

/*1*/		max_sum=0; best_i= -1; best_j= -1;
/*2*/		for(i=0; i<n; i++ )
		{
/*3*/			this_sum = 0;
/*4*/			for(j=i; j<n; j++ )
			{
/*5*/				this_sum += a[j];

/*6*/				if( this_sum > max_sum )
					/* update max_sum, best_i, best_j */;
			}
		}
/*7*/		return( max_sum );
	}