Cod sursa(job #3328750)
| Utilizator | Data | 10 decembrie 2025 09:16:53 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
using namespace std;
int main()
{
long long n;
int x,SumMax=0,Sum,s=0,d=0;
cin>>n;
int a[n+1];
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
for(int j=i;j<=n;j++){
Sum=0;
for(int z=i;z<=j;z++)
Sum+=a[z];
if(Sum>SumMax){
SumMax=Sum;
s=i;
d=j;
}
}
cout<<SumMax<<" "<<s<<" "<<d;
return 0;
}
