Cod sursa(job #2866003)
Utilizator | Data | 9 martie 2022 12:07:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int n,k,a,s,st,dr,l,mx=-99999999;
int main()
{
f >> n;
f >> k;
s=k;
for(int i=2; i<=n; i++)
{
f >> k;
if(s+k>=k)
s=s+k;
else
{
s=k;
l=i;
}
if(s>mx)
{
mx=s;
st=l;
dr=i;
}
}
g<<mx<<" "<<st<<" "<<dr;
return 0;
}