Cod sursa(job #1598038)
Utilizator | Data | 12 februarie 2016 16:13:48 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,nr,i,st,dr,max1,s,p,u;
int main()
{
f>>n;
f>>nr;
p=1;
u=1;
s=nr;
for(i=2;i<=n;i++)
{
f>>nr;
if(s<0)
{
p=i;
u=i;
s=nr;
}
else
{
u=i;
s+=nr;
}
if(s>max1)
{
max1=s;
st=p;
dr=u;
}
}
g<<max1<<" "<<st<<" "<<dr;
return 0;
}