Cod sursa(job #2475471)
Utilizator | Data | 16 octombrie 2019 23:03:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n,m,M=-2000000000,a,b,l,x,j;
int main()
{
fin>>n;
a=1;
b=1;
for(int i=1;i<=n;i++)
{
l=x;
fin>>x;
x+=l;
if(x-m>M)
{
M=x-m;
b=i;
j=a;
}
if(x<m)
{
m=x;
a=i+1;
}
}
fout<<M<<" "<<j<<" "<<b<<'\n';
return 0;
}