Cod sursa(job #873523)
Utilizator | Data | 7 februarie 2013 12:41:52 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,p,nr,st,dr,x,max1,min1;
int main()
{
f>>n;
f>>p;
max1=p;
min1=p;
nr=1;
for(i=2;i<=n;i++)
{
f>>x;
p=p+x;
if(max1<p-min1)
{
max1=p-min1;
st=nr;
dr=i;
}
if(min1>p)
{
min1=p;
nr=i+1;
}
}
g<<max1<<" "<<st<<" "<<dr;
return 0;
}