Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int korongok[100];
- int kovetkezo = 0;
- int arr1(int i, int j);
- int arr2(int i, int j);
- int main() {
- int korongsz;
- cin>>korongsz;
- for (int i=0;i<korongsz;i++){
- cin>>korongok[i];
- }
- cout<<(arr1(1,korongsz));
- return 0;
- }
- int arr1(int i, int j){
- return max(korongok[i] + arr2(i+1,j), korongok[j] + arr2(i,j-1));
- }
- int arr2(int i, int j){
- return min(arr1(i+1,j), arr1(i,j-1));
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement