Cod sursa(job #1231145)
| Utilizator | Data | 19 septembrie 2014 18:21:35 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 65 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 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=-1,ji,ii,ok;
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){
if(s>mx)
{
mx=s;
ji=i;
i2=ii;
ok=1;
}
s=0; ii=i;}
}
if(s>mx&&ok==0)
{
mx=s;
ji=i;
i2=ii;
}
}
g<<mx<<" "<<i2+1<<" "<<ji;
return 0;
}
