Cod sursa(job #3159321)
Utilizator | Data | 21 octombrie 2023 09:35:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<iostream>
#define INFINIT 100000001
using namespace std;
int n,v[6000001],sum,bestsum,a,b;
int main()
{
sum=0;cin>>n;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
for(int i=1;i<=n;i++)
{
sum+=v[i];
if(sum<0)
{
sum=0;a=i+1;
}
else
{
if(sum>bestsum)
{
bestsum=sum;b=i;
}
}
}
cout<<bestsum<<" "<<a<<" "<<b;
return 0;
}