Cod sursa(job #1197453)
Utilizator | Data | 12 iunie 2014 00:18:00 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{int n,x,i;
int bestSum=-1<<30,sum=0,beg,fin,idx;
f>>n;
for (i=1;i<=n;i++)
{f>>x;
if (sum<0) {sum=x;
idx=i;}
else {sum+=x;
if (bestSum<sum) bestSum =sum,beg=idx,fin=i;
}
}
g<<bestSum<<" "<<beg<<" "<<fin;
return 0;
}