Cod sursa(job #2124293)
Utilizator | Data | 7 februarie 2018 08:33:03 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long n,s[6000001],max1=-1000000000,min1=1000000000,st,sf,idx,i;
int main()
{fin>>n;
for(i=1;i<=n;i++){fin>>s[i];}
for(i=1;i<=n;i++){s[i]+=s[i-1];
if(max1<s[i]-min1){max1=s[i]-min1;
st=idx+1;
sf=i;}
if(s[i]<min1){min1=s[i];
idx=i;}
}
fout<<max1<<" "<<st<<" "<<sf;
return 0;
}