Cod sursa(job #2854245)
| Utilizator | Data | 21 februarie 2022 08:51:35 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
using namespace std;
int main()
{
int n,suma,st_max=1,dr_max=1,k,i;
cin>>n;
int v[n+1],sp[n+1];sp[0]=0;
for(k=1; k<=n; k++)
{
cin>>v[k];
}
for(i=1; i<=n; i++)
{
sp[i]=sp[i-1]+v[i];
}
int maxi=v[1];
int min_poz=0;
for(int dr=1; dr<=n; dr++)
{
if(sp[min_poz]>sp[dr-1])
{
min_poz=1;
}
suma=sp[dr]-sp[min_poz];
if(suma>maxi)
{
maxi=suma;
st_max=min_poz;
dr_max=dr;
}
cout<<maxi<<" "<<st_max<<" "<<dr_max;
}
return 0;
}
