Cod sursa(job #499663)
Utilizator | Data | 10 noiembrie 2010 17:02:36 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main() {
long x3,max,n,m,a,i,s,x1,x2;
ifstream aa("ssm.in");
aa >> n;
a=-32000;
m=0;
for (i=1;i<a+1;++i) {
aa >> s;
m=m+s;
x3++;
if(m>max) {
max=m;
x1=i;
x2=x3+i-1;
}
if(m<0) {m=0; x3=0;}
}
ofstream ss("ssm.out");
ss << max;
ss.close();
aa.close();
return 0;
}