Cod sursa(job #2683841)
| Utilizator | Data | 12 decembrie 2020 10:30:29 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#define fq 6000002
using namespace std;
int n,v[fq],i;
int sum,summax;
int st,stmax;
int dr,drmax;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
st=stmax=1;
dr=drmax=1;
sum=summax=v[1];
for(i=2; i<=n; i++)
{
if(sum+v[i]>v[i])
sum+=v[i], dr++;
else
sum=v[i], st=dr=i;
if(sum>summax)
summax=sum, stmax=st, drmax=dr;
}
fout<<summax<<' '<<stmax<<' '<<drmax<<'\n';
return 0;
}
