Cod sursa(job #1649436)
Utilizator | Data | 11 martie 2016 13:38:57 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
using namespace std;
ifstream f("tryhard.in");
ofstream g("tryhard.out");
int n,i,istart,suma,mx=-99999,st,fn,x;
int main(){
f>>n;
for (i=1;i<=n;i++){
f>>x;
if (suma<0){
istart=i;
suma=x;
}
else
suma+=x;
if (suma>mx){
mx=suma;
st=istart;
fn=i;
}
}
g<<mx<<" "<<st<<" "<<fn;
return 0;
}