Cod sursa(job #1003659)
| Utilizator | Data | 1 octombrie 2013 10:45:37 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000002];
int main()
{
int n, i, sa=-1, smax=-9999999999, st=1, dr=1, stf, drf;
f>>n;
for(i=1;i<=n;i++) f>>a[i];
for(i=1;i<=n;i++) {
if(sa<0) {
st=i;
sa=a[i];
}
else {
sa+=a[i];
dr=i;
}
if(sa>smax) {
smax=sa;
stf=st;
drf=dr;
}
}
g<<smax<<" "<<stf<<" "<<drf;
f.close();
g.close();
return 0;
}
