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