Cod sursa(job #2799433)
Utilizator | Ionescu Mihnea mihnea134 | Data | 13 noiembrie 2021 10:37:21 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int v[6000000];
int main()
{
long long int n, i=0, sum=0,maxx=-9223372036854775808,poz1=0,poz2=0;
cin>>n;
for(;i<n;i++)
{
cin>>v[i];
sum+=v[i];
if(sum>maxx)
{
maxx=sum;
poz1=i;
}
}
sum=maxx;
for(i=0;i<=poz1;i++)
{
sum-=v[i];
if(sum>maxx)
maxx=sum,poz2=i;
}
cout<<maxx<<" "<<poz2+2<<" "<<poz1+1;
return 0;
}