Cod sursa(job #267254)
| Utilizator | Data | 26 februarie 2009 23:20:30 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{int i,v[100],max=0,sum=0,n,inceput,sfarsit,poz;
ifstream f("ssm.in");
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
for(i=1; i<=n; i++)
{
if(sum>=0)
sum=sum+v[i];
else
{sum=v[i];
poz=i;
}
if(sum>max)
{max=sum;
inceput=poz;
sfarsit=i;
}
}
ofstream g("ssm.out");
g<<max<<" "<<inceput<<" "<<sfarsit<<endl;
system("pause");
return 0;
}
