Cod sursa(job #2165034)
Utilizator | Data | 13 martie 2018 10:53:44 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,j,n,S,Max,I,st,dr;
int x[6000001];
int main ()
{
Max=-INT_MAX;
f>>n;
for(i=1;i<=n;i++){
f>>x[i];
}
for(i=1;i<=n;i++){
if(S<0){
S=x[i];
I=i;
}
else
S=S+x[i];
if(S>Max){
Max=S;
st=I;
dr=i;
}
}
g<<Max<<" "<<st<<" "<<dr;
}