Cod sursa(job #2157885)
Utilizator | Alexandra alecsanya | Data | 9 martie 2018 23:24:27 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x,sum[6000001],best,n,i1=1,i2=1,aux;
int main()
{
f>>n;
int smax=-INT_MAX;
int mini=0;
for(int i=1; i<=n; i++)
{
f>>x;
sum[i]=sum[i-1]+x;
best=sum[i]-mini;
if(sum[i]<mini)
{
mini=sum[i];
aux=i+1;
}
if(best>smax)
{
smax=best;
i2=i;
i1=aux;
}
}
g<<smax<<" "<<i1<<" "<<i2;
return 0;
}