Cod sursa(job #2551582)
Utilizator | Anica-Popa Vlad-Ioan Vlad_Anica | Data | 19 februarie 2020 22:41:43 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 45 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v[200001];
int main()
{
int n,i,maxx,pozi,pozf,minn,s;
fin >> n;
for(i=1;i<=n;i++)
{
fin >> v[i];
v[i]+=v[i-1];
}
maxx=-100000000;
for(i=1;i<=n;i++)
{
if(v[i]>maxx)
{
maxx=v[i];
pozf=i;
}
}
minn=100000000;
for(i=1;i<=pozf;i++)
{
if(v[i]<minn)
{
minn=v[i];
pozi=i;
}
}
if(pozi==1)
pozi--;
fout << v[pozf]-v[pozi] << " ";
fout << pozi+1 << " " <<pozf;
return 0;
}