Cod sursa(job #1488954)
Utilizator | Data | 20 septembrie 2015 11:48:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
int smax,stmax,drmax,s,st,n,i,x;
f>>n>>s;
smax=s;
stmax=drmax=st=1;
if(s<0){
s=0;
st=2;
}
for(i=2;i<=n;i++){
f>>x;
s+=x;
if(s>smax){
smax=s;
stmax=st;
drmax=i;
}
if(s<0){
s=0;
st=i+1;
}
}
g<<smax<<' '<<stmax<<' '<<drmax;
return 0;
}