Cod sursa(job #711017)
Utilizator | Data | 11 martie 2012 09:38:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
#define Inf 0x3f3f3f3f
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long long n,maxx=-Inf,x,sx=-Inf,isx=1,jsx=1,imax,jmax;
long long maxim(int a,int b)
{
if(a>b)
return a;
return b;
}
int main()
{
f>>n;
for(int i=0;i<n;i++)
{
f>>x;
if(!x)
;
else
if(sx+x>x)
{
sx+=x;
jsx=i+1;
}
else
{
sx=x;
isx=i+1;
jsx=i+1;
}
if(sx>maxx)
{
maxx=sx;
imax=isx;
jmax=jsx;
}
}
g<<maxx<<' '<<imax<<' '<<jmax<<'\n';
return 0;
}