Cod sursa(job #2437858)
Utilizator | Data | 10 iulie 2019 15:46:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<iostream>
using namespace std;
int n,a[6000001],s,Max=-1,poz1,poz2;
int main()
{
cin>>n;
for(int i=1;i<=n;++i)
cin>>a[i];
s=a[1];
int x=1;
for(int i=1;i<n;++i)
for(int j=i+1;j<=n;++j)
{
s+=a[j];
if(s>Max)
{
Max=s;
poz1=i;
poz2=j;
}
if(j==n)
++x, s=a[x];
if(s>Max)
{
Max=s;
poz1=i;
poz2=j;
}
}
cout<<Max<<' '<<poz1<<' '<<poz2;
return 0;
}