Advertisement
Davencode

Untitled

Jan 2nd, 2022
18
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.64 KB | None | 0 0
  1. 19-02-19 Traccia A
  2. AlgoIT(A,x,y,k)
  3. STZ=STY=ST_VAL=ST_A=LAST=NIL
  4. CX=X, CY=Y
  5. while(cx<=cy || sty!=NIL)do
  6. if(cx<=cy)then
  7. val=0
  8. z=cx+cy/2
  9. if(A[z]==k)then
  10. val=1
  11. STY=push(STY,cy)
  12. STZ=push(STZ,z)
  13. ST_VAL=push(ST_VAL,val)
  14. cy=z-1
  15. else
  16. cy=top(STY); z=top(STZ); val=top(ST_VAL)
  17. if(last!=cy)then
  18. a=val
  19. if(a>val)then
  20. val=a+val
  21. pop(ST_VAL)
  22. ST_VAL=push(ST_VAL,val)
  23. STA=push(STA,a)
  24. cx=z+1
  25. else
  26. b=val //da non confondere con l'altro val, questo รจ il ritorno della chiamata ricorsiva (il ritorno ret)
  27. val=val+top(STA)+b
  28. last=cx
  29. cx=cy+1
  30. pop(STA,ST_VAL,STY,STZ)
  31. ret=val
  32. return ret
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement