Cod sursa(job #1071601)

Utilizator L.DanielLungu Daniel L.Daniel Data 3 ianuarie 2014 10:19:24
Problema Subsecventa de suma maxima Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.43 kb
#include <fstream>
using namespace std;
int main()
{
	int a[60000100], b[60000100], i, n, max, j, k;
	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++)
	{
		b[i] = a[i];
		if (a[i] < b[i - 1] + a[i])b[i] = b[i - 1] + a[i];
		else k = i;
		if (b[i]>max)max = b[i], j = i;
	}
	g << max << " " << k << " " << j;
	return 0;
}