Cod sursa(job #1339159)
Utilizator | Data | 10 februarie 2015 18:43:23 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int smax,n,s1,s,j,i,v,p1,p2;
int main()
{smax=-2000000000;
fin>>n;
s1=0;
s=0;
j=0;
for(i=1;i<=n;i++)
{
fin>>v;
s=s+v;
if(s-s1>smax){smax=s-s1;
p1=j+1;
p2=i;
}
if(s<s1){s1=s;
j=i;
}
}
fout<<smax<<" "<<p1<<" "<<p2;
fout.close();
return 0;
}