Cod sursa(job #2032834)
| Utilizator | Data | 5 octombrie 2017 19:19:32 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int V[6000001];
int n,i=1,j=1,suma,sumamax,st,dr,minim;
int main()
{fin>>n;
for(i=1;i<=n;i++)
fin>>V[i];
for(i=1;i<=n;i++)
{suma=suma+V[i];
if(suma>sumamax)
{sumamax=suma;
dr=i;
}
}
suma=sumamax;
for(j=dr;j>1;j--)
{if(minim>V[j])
{minim=V[j];
st=j;
}
}
st++;
sumamax=0;
for(i=st;i<=dr;i++)
sumamax+=V[i];
fout<<sumamax<<' '<<st<<' '<<dr;
return 0;
}
