Cod sursa(job #2490500)
Utilizator | Data | 10 noiembrie 2019 13:55:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int n,a[6000001],s,x,y,m,i;
int main()
{ m=INT_MIN;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(int k=1; k<=n; k++)
{
fin>>a[k];
if(s<0)
{
s=a[k];
i=k;
}
else
{
s+=a[k];
}
if(s>m)
{
x=i;
y=k;
m=s;
}
}
fout<<m<<" "<<x<<" "<<y;
return 0;
}