Cod sursa(job #334985)
Utilizator | Data | 28 iulie 2009 12:55:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,a,p,q,x,mins,maxs,s;
int main()
{
f>>n;
maxs=-0x3f3f3f3f;
mins=0;
x=0;
for(i=1;i<=n;++i)
{
f>>a;
s+=a;
if(s-mins>maxs)
maxs=s-mins,p=x+1,q=i;
if(s<mins)
mins=s,x=i;
}
g<<maxs<<" "<<p<<" "<<q<<"\n";
f.close();
g.close();
return 0;
}