HDU - 1231 - 最大连续子序列

题目链接

点此跳转

思路

同此篇文章

代码

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>

#define LL long long
#define mem(a, b) memset(a, b, sizeof a)
#define lowbit(x) (-x&x)
#define IOS ios::sync_with_stdio(false),cin.tie(0)
#define endl '\n'
#define rev(x) reverse(x.begin(), x.end())
#define INF 0x3f3f3f3f

using namespace std;

const int N = 100010;

int n;
int a[N];
int f[N], g[N];

void solve() {
	while (cin >> n, n) {
		for (int i = 1; i <= n; i ++ ) {
			cin >> a[i];
			f[i] = 0;
			g[i] = i;
		}
		
		int st = 1, ans = -INF;
		for (int i = 1; i <= n; i ++ ) {
			if (a[i] > f[i - 1] + a[i]) {
				f[i] = a[i];
				st = i;
			} else {
				f[i] = f[i - 1] + a[i];
				g[i] = st;
			}
		}
		
		int maxid;
		for (int i = 1; i <= n; i ++ ) {
			if (f[i] > ans) {
				ans = f[i];
				maxid = i;
			}
		}
		
		if (ans < 0) printf("0 %d %d\n", a[1], a[n]);
		else printf("%d %d %d\n",ans,  a[g[maxid]], a[maxid]);
	}
}

int main() {
	IOS;
	
	solve();
	
	return 0;
}