Cod sursa(job #1433017)
Utilizator | Data | 9 mai 2015 14:43:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream file_in ("ssm.in");
ofstream file_out ("ssm.out");
int main()
{
int n, sum = 0, incp = 1, sf, nr, max = 0, lung;
file_in >> n;
for(int i = 0; i < n; i++)
{
file_in >> nr;
sum += nr;
if(sum > max)
{
max = sum;
sf = i+1;
//lung = sf - incp;
}
if(sum < 0)
{
sum = 0;
incp = i+2;
}
}
file_out << sum << " " << incp << " " << sf;
return 0;
}