Cod sursa(job #1005828)
Utilizator | Data | 5 octombrie 2013 21:46:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n, x[100000], st, dr, poz, pozf;
int main(){
f>>n;
for(int i=0; i<n; ++i) f>>x[i];
int Smax=x[0];
for(st=0; st<n; st++)
for(int sum=0, dr=st; dr<n; dr++){
sum+=x[dr];
if(sum>Smax) Smax=sum, poz=st, pozf=dr;
}
g<<Smax<<" "<<poz+1<<" "<<pozf+1<<'\n';
return 0;
}