2012-12-09
■ TopCoder SRM563 Div2 1000
これを通せたおかげで緑になれた(感激)
#includeusing namespace std; class SpellCardsEasy{ public: int maxDamage(vector <int> level, vector <int> damage){ int dp[53][51]={}; for(int i=0;i for(int j=0;j<=level.size();j++){ if(j-i 1][j]=dp[i][j]; }else{ dp[i+1][j]=max(dp[i][j],dp[i][j-level[i]]+damage[i]); } } } return dp[level.size()][level.size()]; } };