Cod sursa(job #1130823)
Utilizator | Data | 28 februarie 2014 15:50:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
int main()
{
int n,s[255],i,nr,sf,best;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>s[i];
best=s[1];
for(i=2;i<=n;i++)
{
if(s[i]<s[i]+s[i-1])
{
nr++;
s[i]=s[i]+s[i-1];
}
else
nr=0;
if(best<s[i])
{
best=s[i];
sf=i;
}
}
g<<best<<" "<<sf-nr+1<<" "<<sf;
return 0;
}