Cod sursa(job #1072665)
Utilizator | Data | 4 ianuarie 2014 18:55:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int si,sf,sim,sfm,s[6000001],Max,n,x,i;
int main()
{
f>>n;
si=1;
sf=1;
Max=-999999999;
for(i=1;i<=n;i++){
f>>x;
if(s[i-1]+x>x){
s[i]=s[i-1]+x;
sf=i;}
else{
s[i]=x;
si=i;
sf=i;}
if(Max<s[i]){
Max=s[i];
sim=si;
sfm=sf;}}
g<<Max<<" "<<sim<<" "<<sfm;
return 0;
}