Cod sursa(job #2926955)
Utilizator | Gabriel Stefan Tita gabriel.9619 | Data | 18 octombrie 2022 23:17:13 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.66 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n, poz=1, j=0, i, pozmax, jmax, lungime=0, lungimemax=100000000;
long long x, s=0, smax=0;
fin>>n;
if(n==1)
{
fin>>x;
fout<<x<<" "<<1<<" "<<1;
return 0;
}
for(i=1;i<=n;i++)
{
fin>>x;
if(s+x>x)
{
j++;
s=1LL*s+x;
lungime=j-poz+1;
if(s>smax||i==1)
{
smax=1LL*s;
pozmax=poz;
jmax=j;
lungimemax=lungime;
}
else
{
if(s==smax&&poz==pozmax)
{
if(lungime<lungimemax)
{
smax=1LL*s;
pozmax=poz;
jmax=j;
lungimemax=lungime;
}
}
}
}
else
{
s=1LL*x;
poz=j+1;
j++;
lungime=1;
if(s>smax||i==1)
{
smax=1LL*s;
pozmax=poz;
jmax=j;
lungimemax=lungime;
}
else
if(s==smax&&poz==pozmax)
{
if(lungime<lungimemax)
{
smax=1LL*s;
pozmax=poz;
jmax=j;
lungimemax=lungime;
}
}
}
}
fout<<smax<<" "<<pozmax<<" "<<jmax;
return 0;
}