Cod sursa(job #1811578)
Utilizator | Data | 21 noiembrie 2016 12:43:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | gym1_emag_mediu_2016 | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,S,i,maxx=-(1<<30),x,d=1,in,sf;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(S<0)
{
S=x;
d=i;
}
else
S=S+x;
if(S>maxx)
{
maxx=S;
in=d;
sf=i;
}
}
g<<maxx<<" "<<in<<" "<<sf;
f.close();
g.close();
}