Cod sursa(job #625479)
Utilizator | Marussi Ioana IoanaMar | Data | 24 octombrie 2011 19:59:49 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 75 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int sMax,sum,i,j=1,n,s,d,a;
sMax=0;
f>>n;
f>>a;
sum=a;
for (i=1; i<=n; i++)
{
f>>a;
if(sum>=0)
sum=sum+a;
else
{
j=i;
sum=a;
}
if (sum>sMax)
{
s=j;
d=i;
sMax=sum;
}
}
g<<sMax<<" "<<s+1<<" "<<d+1;
f.close();
g.close();
return 0;
}