Cod sursa(job #2506309)
| Utilizator | Data | 7 decembrie 2019 20:09:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int x[6000001], s[6000001], ifinal=1, iinceput=1, n, i;
int main()
{
fin>>n;
for(i=1;i<=n;i++)fin>>x[i];
s[1]=x[1];
ifinal=1;
for(i=2;i<=n;i++){
s[i]=s[i-1]+x[i];
if(x[i]>0) ifinal=i;
if(x[i]>s[i-1] && s[i-1]<0) iinceput=i;
}
fout<<s[ifinal]-s[iinceput-1]<<" "<<ifinal<<" "<<iinceput;
return 0;
}
