Cod sursa(job #3250129)
Utilizator | Data | 19 octombrie 2024 12:02:15 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,d[6000001],x,mx,st,dr;
int main()
{
fin >>n;
for(int i = 1;i <= n;i++)
{
fin >>x;
if(x > x+d[i-1])
{
st = i;
d[i] = x;
}
else
{
d[i] = x+d[i-1];
}
if(d[i] > mx)
{
mx = d[i];
dr = i;
}
}
fout <<st<<" "<<dr<<" "<<mx;
return 0;
}