Cod sursa(job #473329)
Utilizator | Data | 28 iulie 2010 21:58:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long n,min1,x,b,e,sum,s,bm;
int main()
{ f>>n>>x;
min1=x;
s=x;
bm=1;
sum=s , b=bm , e=1;
for(int i=2;i<=n;i++)
{ f>>x;
s+=x;
if(s-min1>sum)
sum=s-min1 , b=bm , e=i;
if(min1>s)
min1=s , bm=i+1;
}
g<<sum<<" "<<b<<" "<<e;
f.close();
g.close();
return 0;
}