Cod sursa(job #2637953)
Utilizator | Razvan Diaconescu RTG123 | Data | 25 iulie 2020 21:08:38 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long int n,v[6000001],min1,poz1=1,poz2,pp,max1;
int main()
{
f>>n;
for (int i=1; i<=n; i++)
{
f>>v[i];
v[i]+=v[i-1];
}
max1=v[1];
for (int i=1; i<=n; i++)
{
if (v[i]-min1>max1)
{
max1=v[i]-min1;
poz2=i;
pp=poz1;
}
if (min1>v[i])
{
min1=v[i];
poz1=i;
}
}
g<<max1<<' '<<pp+1<<' '<<poz2;
return 0;
}