Cod sursa(job #2242518)
Utilizator | Sabau Florin Vlad Haesteinn | Data | 18 septembrie 2018 20:40:36 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000002],n;
int bestest=0,st,dr;
int main()
{
int best=0;
fin>>n;
for(int i=0;i<n;i++)
{
int x;
fin>>x;
if(best+x<x)
st=i+1;
best=max(best+x,x);
if(best>bestest)
{
bestest=best;
dr=i+1;
}
bestest=max(bestest,best);
}
fout<<bestest<<" "<<st<<" "<<dr;
return 0;
}