Cod sursa(job #1231142)
Utilizator | Data | 19 septembrie 2014 18:07:56 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#define Inf 0x3f3f3f3f
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,a[5001],i2,j2,j3,mx,x,s,ji,ii ;
int main()
{
f>>n;
mx=-Inf;
for(i=1;i<=n;i++)
{
f>>x;
if(s < x)
s=s+x;
else
{ s=s+x;
if(s<=0){s=0; ii=i;}
}
if(s>mx)
{
mx=s;
ji=i;
i2=ii;
}
}
g<<mx<<" "<<i2+1<<" "<<ji;
return 0;
}