Cod sursa(job #584876)
Utilizator | Data | 26 aprilie 2011 21:48:18 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x1,x2,n,st,sf,i,j,sfx,stx,cmax;
int main()
{
f>>n;
f>>x1;
st=1;
sf=1;
cmax=x1;
for (i=2;i<=n;i++)
{
f>>x2;
if (x2>cmax) cmax=x2;
if (x1>0) {x2=x2+x1;sf=i;}
else st=i;
if (x2>cmax) {cmax=x2;sfx=sf;stx=st;
}
x1=x2;
}
if (n==1)
g<<cmax<<" "<<1<<" "<<1; else
g<<cmax<<" "<<stx<<" "<<sfx<<'\n';
f.close();
g.close();
return 0;
}