Mai intai trebuie sa te autentifici.
Cod sursa(job #2873817)
Utilizator | Data | 19 martie 2022 11:45:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n,v[6000005],i,maxim,minim,st,dr,s[6000005],sum,pozmin;
int main()
{
fin>>n;
s[0]=0;
for(i=1; i<=n; i++)
{
fin>>v[i];
s[i]=s[i-1]+v[i];
}
st=0;
dr=1;
pozmin=0;
maxim=s[1];
for(i=1; i<=n; i++)
{
sum=s[i]-minim;
if(sum>maxim)
{
maxim=sum;
st=pozmin;
dr=i;
}
if(s[i]<minim)
{
minim=s[i];
pozmin=i;
}
}
fout<<maxim<<" "<<st+1<<" "<<dr;
return 0;
}