Maximum Subsequence Sum

Given a sequence of K integers { N
​1
​​ , N
​2
​​ , …, N
​K
​​ }. A continuous subsequence is defined to be { N
​i
​​ , N
​i+1
​​ , …, N
​j
​​ } where 1≤i≤j≤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 (≤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

//会在线处理的话，会优化很多，但还要注意负数和0情况的处理，最重要的
是head的记录；（所以我选择用一个副头先来记录）

#include<stdio.h>
int arr[100000];
int main()
{
int n, i, max = 0, now = 0,fhead,head,end,flag=1;
scanf_s("%d", &n);
for (i = 0; i < n; i++)
scanf_s("%d", &arr[i]);
int zore = 0;
for (i = 0; i < n; i++)//判断数据属于哪个类型：只有负数，只有负数和0，和其他类
{
if (arr[i] >0)
flag = 0;
if (arr[i]0)
zore = 1;
}
if (flag1&& zore == 0)
{
head = arr[0];
end = arr[n-1];
max = 0;
}//只有负数
else if (zore 1&&flag1)
{
head = 0;
end = 0;
max = 0;
}//只有负数和0
else //其他类
{
flag = 0;
for (i = 0; i < n; i++)
{
if (now0&&flag0)//保证副头是在now重置情况下记录的
fhead = arr[i];
flag = 1;
now = now + arr[i];
if (now >max)
{
max = now;
head = fhead;//副头作用：保证头记录的是真正是连续最大值的头
end = arr[i];
}

	else if (now < 0)
	{
         now = 0;
		 flag =0;
	}
		
}//在线处理

}

printf("%d %d %d\n", max,head,end);
return 0;

}