Cod sursa(job #2232176)
Utilizator | Data | 17 august 2018 17:14:09 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,a,x,s=-INT_MAX,bests=-INT_MAX,f,l;
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
{
cin >> x;
if(s<0)
{
s=x;
a=i;
}
else
{
s+=x;
}
if(s>bests)
{
bests=s;
f=a;
l=i;
}
}
cout << bests << ' ' << f << ' ' << l;
return 0;
}