Cod sursa(job #2290531)
Utilizator | Data | 26 noiembrie 2018 17:16:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int n, sc=0, smax=1<<31, inc=1, sf=1, incmx=0, sfmx=0;
in >> n;
for(int i=1; i<=n; i++)
{
int x;
in >> x;
if(sc+x>=x)
{
sf++;
sc+=x;
}
else
{
inc=sf=i;
sc=x;
}
if(sc>smax)
{
smax=sc;
incmx=inc;
sfmx=sf;
}
}
out << smax << ' ' << incmx << ' ' << sfmx;
return 0;
}