Cod sursa(job #2394385)
Utilizator | Data | 1 aprilie 2019 16:38:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,s,maxx=0,pi,pf,x,p;
int main()
{ f>>n;
for(int i=1;i<=n;i++)
{ f>>x;
if(s<0)
{ s=x; p=i;
}
else s=s+x;
if(s>maxx)
{ maxx=s;
pi=p;
pf=i;
}
}
g<<maxx<<" "<<pi<<" "<<pf;
f.close();
g.close();
return 0;
}