Cod sursa(job #2866024)
| Utilizator | Data | 9 martie 2022 12:15:29 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int a[6000002],n;
int main()
{
f >> n;
for(int i=1; i<=n; i++)
{
f >> a[i];
}
int s=a[1],j=1,smx=a[1],st=1,dr=1;
for(int i=2; i<=n; i++)
{
if(s>=0)
s=s+a[i];
else
{
s=a[i];
j=i;
}
if(s>smx)
{
smx=s;
dr=i;
st=j;
}
}
if(s>smx)
{
smx=s;
dr=n;
st=j;
}
g<<smx<<" "<<st<<" "<<dr;
return 0;
}
