Cod sursa(job #1239520)
Utilizator | Data | 9 octombrie 2014 10:11:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,n,Sc,a[1000],x,y,Smax;
int main()
{
f>>n;
for(i=1;i<=n;i++)f>>a[i];
Sc=Smax=a[1];
p=x=y=1;
for(i=2;i<=n;i++){
if(Sc>0)Sc+=a[i];
else{Sc=a[i];
p=i;
}
if(Sc>Smax){
Smax=Sc;
x=p;
y=i
}
}
g<<Smax<<x<<y;
return 0;
}