题目:
6 -2 11 -4 13 -5 -2 10 -10 1 2 3 4 -5 -23 3 7 -21 6 5 -8 3 2 5 0 1 10 3 -1 -5 -2 3 -1 0 -2 0
20 11 13 10 1 4 10 3 5 10 10 10 0 -1 -2 0 0 0
原题一堆乱码……其实就是求最大连续子段和。并要求输出最大和以及其起止元素。
若元素均为负数,则输出其起止元素。
解题思路:
源代码:
#include <bits/stdc++.h>
using namespace std;
int main()
{
int num[10005],i,dp[10005],n,maxl[10005],maxr[10005],ma; //maxl和maxr用于记录每段和的起止元素
while (cin >> n)
{
int flag = 0;
int j = 1;
if (n == 0)
break;
memset(num, 0 , sizeof(num));
memset(dp, 0 , sizeof(dp));
memset(maxl , 0, sizeof(maxl));
memset(maxr, 0 , sizeof(maxr));
for (i = 1; i <= n; i++) //首先判断元素是否均为负数。
{
cin >> num[i];
if (num[i] >= 0)
flag = 1;
}
if (flag == 0)
{
cout << 0 << " " << num[1] << " " << num[n] << endl;
continue;
}
dp[0] = 0;
// dp[1] = num[1];
// maxl[1] = dp[1];
// maxr[1] = dp[1];
for (i = 1; i <= n; i++) //求最大连续子段和,并标记其起止位置的元素。
{
dp[i] = max (dp[i - 1] + num[i], 0);
if (dp[i] == 0)
{
maxl[i] = num[i];
maxr[i] = num[i];
j = i + 1;
}
else
{
maxl[i] = num[j];
maxr[i] = num[i];
}
}
ma = 0;
int mal = 0,mar = 0;
for (i = 1; i <= n; i++)
if (ma < dp[i])
{
ma = dp[i];
mal = maxl[i];
mar = maxr[i];
}
//for (i = 1; i <= n; i++)
// cout << dp[i] << " " ;
//cout << endl;
cout << ma << " " << mal << " " << mar << endl;
}
return 0;
}