Cod sursa(job #1071621)

Utilizator L.DanielLungu Daniel L.Daniel Data 3 ianuarie 2014 11:20:45
Problema Subsecventa de suma maxima Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.41 kb
#include <fstream>
using namespace std;
int main()
{
	int a[999999], i, n, max, j, k, x;
	ifstream f("ssm.in");
	ofstream g("ssm.out");
	f >> n;
	for (i = 1; i <= n; i++)
		f >> a[i];
	max = a[1];
	k = j = 0;
	for (i = 1; i <= n; i++)
	{
		if (a[i] <= a[i - 1] + a[i])a[i] = a[i - 1] + a[i];
		else k = i;
		if (a[i] > max)max = a[i], j = i, x = k;
	}
	g << max << " " << x << " " << j;
	return 0;
}