Cod sursa(job #2490945)
Utilizator | Data | 11 noiembrie 2019 14:38:24 | |
---|---|---|---|
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,v[6000001],s,x,y,m,p;
int main()
{ m=INT_MIN;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(int i=1; i<=n; i++)
{
fin>>v[i];
if(s<0)
{
s=v[i];
p=i;
}
else
{
s+=v[i];
}
if(s>m)
{
x=p;
y=i;
m=s;
}
}
fout<<m<<" "<<x<<" "<<y;
return 0;
}