Cod sursa(job #1516683)
Utilizator | Data | 3 noiembrie 2015 13:25:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
int i,i1,pozi,pozj,max1=-210000,n,s=-1,x;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(s>=0)
s=s+x;
else
{
i1=i;
s=x;
}
if(s>max1)
{
max1=s;
pozi=i1;
pozj=i;
}
}
g<<max1<<' '<<pozi<<' '<<pozj;
return 0;
}