Cod sursa(job #2602671)
Utilizator | Data | 17 aprilie 2020 16:58:22 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int n,x,w,m,p,q,st,dr;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main(){
fin>>n;
fin>>x;
w=m=x;p=q=st=dr=1;
for(int i=2;i<=n;++i){
fin>>x;
if(x>w+x)
st=i,dr=i,w=x;
else
dr++,w+=x;
if(m<w)
p=st,q=dr,m=w;
}
fout<<m<<" "<<p<<" "<<q;
return 0;
}