Sollicitatievraag bij Meta
Largest subsequence sum
Antwoord op sollicitatievraag
Anoniem
3 apr 2012
dp[0] = arr[0]; for(i = 1; i arr[i]) dp[i] = dp[i-1]+arr[i]; else dp[i] = arr[i]; } for(int i = 0; i < dp.size(); i++) cout << dp[i] << endl;
Largest subsequence sum
Anoniem
dp[0] = arr[0]; for(i = 1; i arr[i]) dp[i] = dp[i-1]+arr[i]; else dp[i] = arr[i]; } for(int i = 0; i < dp.size(); i++) cout << dp[i] << endl;