Cod sursa(job #899898)
Utilizator | Data | 28 februarie 2013 16:45:25 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000001], n;
int main () {
int i, j, k, smax=0, sc=0, start, end;
in>>n;
for(i=1; i<=n; i++) in>>v[i];
for(i=1; i<=n; i++) {
sc=0;
for(k=i; k<=j; k++)
sc+-v[k];
if(sc>smax) { smax=sc;
start=i;
end=j;
}
}
out<<smax<<" "<<start<<" "<<end;
return 0;
}