Cod sursa(job #3287031)
Utilizator | Data | 14 martie 2025 23:07:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,v[1001],s,poz,st,dr,smax;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
poz=1;
smax=-1e9;
for(int i=1; i<=n; i++)
{
if(s<0)
{
s=0;
poz=i;
}
s=s+v[i];
if(s>smax)
{
smax=s;
st=poz;
dr=i;
}
}
cout<<smax<<" "<<st<<" "<<dr;
return 0;
}