Cod sursa(job #1339167)
Utilizator | Data | 10 februarie 2015 18:46:37 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream fin("smm.in");
ofstream fout("smm.out");
int n,i,j,Smax,S1,S,v,p1,p2;
int main()
{
fin>>n;
Smax=-2000000;
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;
}