Cod sursa(job #3196255)
Utilizator | Hutanu Ioana-Maia Hutanu_Maia | Data | 23 ianuarie 2024 12:35:23 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,v[6000011],s[6000011],maxim,poz1,poz2,poz;
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
for(int i=1; i<=n; i++)
{
s[i]=max(s[i-1]+v[i],v[i]);
if(s[i]==v[i])
poz=i;
if(maxim<s[i])
{
maxim=s[i];
poz1=poz;
poz2=i;
}
}
fout<<maxim<<' '<<poz1<<' '<<poz2;
return 0;
}