Cod sursa(job #3030104)
| Utilizator | Data | 17 martie 2023 15:20:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,start,dr,st,a[6000001];
long long suma=-1,Max=-1;
int main()
{
cin>>n;
for(int i=1;i<=n;++i)
cin>>a[i];
for(int i=1;i<=n;++i)
{
if(suma<0)
{
suma = 0;
start = i;
}
suma+=a[i];
if(suma>Max)
{
Max = suma;
st=start;
dr=i;
}
}
cout<<Max<<' '<<st<<' '<<dr;
return 0;
}
