Cod sursa(job #3196924)

Utilizator BoggiGurau Bogdan Boggi Data 24 ianuarie 2024 22:34:49
Problema Subsecventa de suma maxima Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("ssm.in");
ofstream fout("ssm.out");

struct SumS {
	long long val, lft = 1, rgt = 1;
} maxS, crS;

int main()
{
	int noNums;
	maxS.val = -int(2e9);
	fin >> noNums;
	for (int i = 0; i < noNums; ++i) {
		int number;
		fin >> number;
		if (crS.val < 0) {
			crS.val = number;
			crS.lft = crS.rgt = i + 1;
		} else {
			crS.val += number;
			crS.rgt = i + 1;
		}
		if (maxS.val < crS.val) {
			maxS = crS;
		}
	}
	fout << maxS.val << ' ' << maxS.lft << ' ' << maxS.rgt;
}

/*
8
-1  5 -4 3 2 -5 3 2 
6 t
7 p2
7 u2

8
5 -6 3 4 -2 3 5 -3
Daca el < 0 facem maxim cu ceea ce avem 
Daca Ssub + el > 0 merita, altfel nu
Merita sa il adaug pe cel de pe poz cur la subM sau nu?
SSub + el < SSub, dar SSub + El > 0, il consideram ca il adaugam, insa notam ca max Sub avuta
Daca Ssub <
*/