Cod sursa(job #1280260)
Utilizator | marian BKmarian | Data | 1 decembrie 2014 18:01:05 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in.txt");
ofstream g("ssm.out.txt");
int i,j,x,y,sx,sy,s,smax,a[50];
long n;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
smax=a[1];
s=a[1];
x=1;y=1;sx=1;sy=1;
for(i=2;i<=n;i++)
{
if(s<0 && s<a[i])
{
s=a[i];
x=i;y=i;
}
else
{
s=s+a[i];
y=i;
}
if(smax<s)
{
smax=s;
sx=x;
sy=y;
}
}
g<<smax<<" "<<sx<<" "<<sy;
}