Cod sursa(job #825027)
Utilizator | Data | 27 noiembrie 2012 11:46:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<fstream>
using namespace std;
ifstream f("SSM.in");
ofstream g("SSM.out");
int n, rm=-1000000, S=0, b, s, p[100], z;
int main(){
f>>n;
for(int i=1;i<=n;++i){
f>>p[i];
if(S<0){S=0;z=i;}
S+=p[i];
if(S>rm){rm=s;s=z;b=i;}
}
g<<rm<<' '<<s<<' '<<b<<'\n';
g.close();
return 0;
}