Cod sursa(job #3159293)
Utilizator | Data | 21 octombrie 2023 08:48:38 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
using namespace std;
int v[6000001],n,i,j,st,dr,maxim,a;
int main()
{
cin>>n;
maxim=-2147483640;
for(i=1;i<=n;i++)
{
cin>>a;
v[i]=v[i-1]+a;
for(j=1;j<i;j++)
{
if(v[i]-v[j-1]>maxim)
{
maxim=v[i]-v[j-1];
st=j;
dr=i;
}
}
}
cout<<maxim<<" "<<st<<" "<<dr;
}