Cod sursa(job #1679293)
Utilizator | Data | 7 aprilie 2016 20:41:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ofstream g("ssm.out");
ifstream f("ssm.in");
int main()
{
long long int n, i, S, bestSum=-1000000000000, sum=0, be, en, idx;
f>>n;
for (i=0;i<n;i++)
{
f>>S;
if (sum<0)
sum=S, idx=i;
else
sum=sum+S;
if (bestSum<sum)
bestSum=sum, be=idx, en=i;
}
g<<bestSum<<' '<<be+1<<' '<<en+1;
return 0;
}