Cod sursa(job #3129787)
| Utilizator | Data | 15 mai 2023 20:03:39 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,i,j,minim=999999999,st,dr,imin,maxim=INT_MIN;
long long v[6000002];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>v[i];
for(i=1; i<=n; i++)
v[i]=v[i-1]+v[i];
for(i=1; i<=n; i++)
{
if(v[i]-minim>maxim)
{
maxim=v[i]-minim;
dr=i;
st=imin+1;
}
if(v[i]<minim)
{
minim=v[i];
imin=i;
}
}
fout<<maxim<<" "<<st<<" "<<dr;
return 0;
}
