Cod sursa(job #628416)
| Utilizator | Data | 1 noiembrie 2011 12:49:38 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int pozi,pozj,s=0,i,n,j,i1,x,max1=-12100000;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
if(s>0)
s+=x;
else
{
i1=i;
s=x;
}
if(s>max1)
{
pozi=i1;
max1=s;
pozj=i;
}
}
g<<max1<<" "<<pozi<<" "<<pozj;
}