第一次编程作业



01-复杂度1 最大子列和问题   (20分)

给定$K$个整数组成的序列{N1N_1N​1​​,N2N_2N​2​​, ..., NKN_KN​K​​ }，“连续子列”被定义为{ NiN_iN​i​​,Ni+1N_{i+1}N​i+1​​, ..., NjN_jN​j​​ }，其中 $1\le i\le j\le K$。“最大子列和”则被定义为所有连续子列元素的和中最大者。例如给定序列{ -2, 11, -4, 13, -5, -2 }，其连续子列{ 11, -4, 13 }有最大的和20。现要求你编写程序，计算给定整数序列的最大子列和。

本题旨在测试各种不同的算法在各种数据情况下的表现。各组测试数据特点如下：

• 数据1：与样例等价，测试基本正确性；
• 数据2：10²个随机整数；
• 数据3：10³个随机整数；
• 数据4：10⁴个随机整数；
• 数据5：10⁵个随机整数；

输入格式:

输入第1行给出正整数$K$ ($\le 100000$)；第2行给出$K$个整数，其间以空格分隔。

输出格式:

在一行中输出最大子列和。如果序列中所有整数皆为负数，则输出0。

输入样例:

6
-2 11 -4 13 -5 -2

输出样例:

20

//不知道哪里出毛病了。。。改好了再贴上来

01-复杂度2 Maximum Subsequence Sum   (25分)

Given a sequence of $K$ integers { N1N_1N​1​​,N2N_2N​2​​, ..., NKN_KN​K​​ }. A continuous subsequence is defined to be { NiN_iN​i​​,Ni+1N_{i+1}N​i+1​​, ..., NjN_jN​j​​ } where $1\le i\le j\le K$. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given sequence { -2, 11, -4, 13, -5, -2 }, its maximum subsequence is { 11, -4, 13 } with the largest sum being 20.

Now you are supposed to find the largest sum, together with the first and the last numbers of the maximum subsequence.

Input Specification:

Each input file contains one test case. Each case occupies two lines. The first line contains a positive integer$K$ ($\le 10000$). The second line contains $K$ numbers, separated by a space.

Output Specification:

For each test case, output in one line the largest sum, together with the first and the last numbers of the maximum subsequence. The numbers must be separated by one space, but there must be no extra space at the end of a line. In case that the maximum subsequence is not unique, output the one with the smallest indices $i$ and $j$ (as shown by the sample case). If all the $K$ numbers are negative, then its maximum sum is defined to be 0, and you are supposed to output the first and the last numbers of the whole sequence.

Sample Input:

10
-10 1 2 3 4 -5 -23 3 7 -21

Sample Output:

10 1 4

这道题目的大概意思是：

输入：

N（给定的N个数据）

输出：

最大子列和，最大子列和的首尾数据

#include <stdio.h>

void MaxSubqueueSum(int A[], int N)
{
	int ThisSum = 0;
	int MaxSum = 0;
	int i, k;
	int begin, end;
	
	for(i = 0; i < N; i++){
		ThisSum += A[i];	//子列和 
		//如果本次累加的总和超过历史最大总和，则更新 
		if(ThisSum > MaxSum){
			MaxSum = ThisSum;
			k = i;		//标记终点的位置 
		}
		//如果子列和小于0，则令其为0，没必要再累加 
		else if(ThisSum < 0){
			ThisSum = 0;
		}	
	}
	//判断起点终点的位置 
	end = A[k];
	for(; k > 0 && A[k] > 0; k--)
		begin = A[k];	//起点肯定要大于0 
	printf("%d %d %d",MaxSum, begin, end);
}

int main()
{
	int N, i, Num;
	scanf("%d",&N);
	int A[N];
	
	for(i = 0; i < N; i++){
		scanf("%d",&Num);
		A[i] = Num;
	}
	MaxSubqueueSum(A, N);
	
	return 0;
}