Cod sursa(job #1647479)
Utilizator | Data | 10 martie 2016 20:47:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n, S, i;
int bestSum=-int(2e9), sum=0, start, finish, idx;
in>>n;
for(i=1;i<=n;i++) {
in>>S;
if(sum<0)
sum=S, idx=i;
else
sum+=S;
if(bestSum<sum)
bestSum=sum, start=idx, finish=i;
}
out<<bestSum<<" "<<start<<" "<<finish<<endl;
return 0;
}