Advertisement
Guest User

Untitled

a guest
Oct 17th, 2019
106
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.49 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5.  
  6. int korongok[100];
  7. int kovetkezo = 0;
  8. int arr1(int i, int j);
  9. int arr2(int i, int j);
  10.  
  11. int main() {
  12. int korongsz;
  13.  
  14. cin>>korongsz;
  15.  
  16. for (int i=0;i<korongsz;i++){
  17. cin>>korongok[i];
  18. }
  19.  
  20. cout<<(arr1(1,korongsz));
  21.  
  22. return 0;
  23. }
  24.  
  25. int arr1(int i, int j){
  26. return max(korongok[i] + arr2(i+1,j), korongok[j] + arr2(i,j-1));
  27. }
  28.  
  29. int arr2(int i, int j){
  30. return min(arr1(i+1,j), arr1(i,j-1));
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement