Cod sursa(job #824965)
Utilizator | Data | 27 noiembrie 2012 11:26:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,drt,stg,numar,l,x;
int maxi=-8500000;
int main(){
f>>n;
for(i=1;i<=n; ++i){
f>>numar;
if(x<0){x=0; l=i;}
x=x+numar;
if(x>maxi){
stg=l;
drt=i;
maxi=x;
}
}
g<<maxi<<' '<<stg<<' '<<drt<<'\n';
return 0;}