radhe radhe || simple and easy solution || beats 100%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int dp[201][201];\n    int solve(int day,int curr_city,int k,int n,vector<vector<int>> &stayScore,vector<vector<int>> &travelScore){\n        if(day>=k||curr_city>=n)return 0;\n        if(dp[day][curr_city]!=-1)return dp[day][curr_city];\n        int score=stayScore[day][curr_city]+solve(day+1,curr_city,k,n,stayScore,travelScore);\n        for(int des_city=0;des_city<n;des_city++){\n            if(des_city==curr_city)continue;\n            score=max(score,travelScore[curr_city][des_city]+solve(day+1,des_city,k,n,stayScore,travelScore));\n        }\n        return dp[day][curr_city]=score;\n    }\n    int maxScore(int n, int k, vector<vector<int>>& stayScore, vector<vector<int>>& travelScore) {\n        int ans=0;\n        memset(dp,-1,sizeof(dp));\n        for(int i=0;i<n;i++){\n            ans=max(ans,solve(0,i,k,n,stayScore,travelScore));\n        }\n        return ans;\n    }\n};\n```
[]