Cod sursa(job #1633591)
Utilizator | Data | 6 martie 2016 12:29:51 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000010],n,st,dr,i,s,ss,stt,drr;
int main()
{
f>>n;
for(i=1;i<=n;++i)
f>>v[i];
st=1;
dr=1;
ss=-2000000000;
for(i=1;i<=n;++i)
{
if(s<0)
{
s=0;
st=i;
dr=i;
}
s=s+v[i];
if(ss<s)
{
ss=s;
stt=st;
drr=dr;
}
}
g<<ss<<" "<<stt<<" "<<drr;
return 0;
}