Cod sursa(job #2983039)
Utilizator | Data | 21 februarie 2023 14:46:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
int n,i,v[1001],s,poz,dr,maxim=-999999,st;
int main()
{
cin>>n;
for(i=1; i<=n; i++)
cin>>v[i];
for(i=1; i<=n; i++)
{
if(s<0)
{
s=v[i];
poz=i;
}
else
{
s=s+v[i];
if(s>maxim)
{
maxim=s;
st=poz;
dr=i;
}
}
}
cout<<maxim<<" "<<st<<" "<<dr;
return 0;
}