Cod sursa(job #824937)
Utilizator | Data | 27 noiembrie 2012 11:15:20 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, i,j, nr, st, dr, x;
int sum=0, maxim=-1000000;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>nr;
if(sum<0)
{
sum=0;
j=i;
}
sum=sum+nr;
if(sum>maxim)
{
st=j;
dr=i ;
maxim=sum;
}
}
g<<maxim<<' '<<st<<' '<<dr<<'\n';
g.close();
return 0;
}