Cod sursa(job #2209433)
Utilizator | Data | 3 iunie 2018 13:46:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <iostream>
using namespace std;
int v[6000000];
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n, i, S=0, maxim=-2e9,st=0,dr=0,stc=0;
in>>n;
for(i=1;i<=n;i++)
{
in>>v[i];
if(S+v[i]<0)
{
S=0;
stc=i+1;
}
else
{
S=S+v[i];
}
if(S>maxim)
{
maxim=S;
st=stc;
dr=i;
}
}
out<<maxim<<' '<<st<<' '<<dr;
return 0;
}