Cod sursa(job #1619438)
Utilizator | Data | 28 februarie 2016 16:07:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, i, x, in, inaux=1, sf, s=-1, maxx=-(1<<30);
int main()
{ f>>n;
for (i=1;i<=n;i++)
{ f>>x;
if (s<0)
{ s=x;
inaux=i;
}
else s=s+x;
if (s>maxx)
{ maxx=s;
in=inaux;
sf=i;
}
}
g<<maxx<<' '<<in<<' '<<sf;
return 0;
}