Cod sursa(job #868798)
Utilizator | Contvechidontdeactivatepls unsilviu | Data | 31 ianuarie 2013 17:24:31 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
int main() {
int i,n,cr,ant,bst,b,bg,end,bgf;
ifstream in("ssm.in");
ofstream out("ssm.out");
in>>n;
in>>ant;
bst = ant;
for (i=2; i<=n; i++) {
in>>cr;
b=max(cr,ant+cr);
if (cr>ant+cr)
bg=i;
if (b>bst) {
bgf = bg;
bst=b;
end=i;
}
ant=b;;
}
out<<bst<<' '<<bgf<<' '<<end<<'\n';
out.close();
return 0;
}