Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int algo(int a, int b, int n)
- if a >b ou a==0 ou b ==n-1 ## il faut considerer a comme i et b comme j
- return 0
- else
- for i in 1..n
- for j in 1..n
- return t[i][j]+ max (algo(i+1,j+1, n), algo(i-1,j,n))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement