Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int maxLength = 1, bestEnd = 0;
- DP[0] = 1;
- prev[0] = -1;
- for (int i = 1; i < N; i++)
- {
- DP[i] = 1;
- prev[i] = -1;
- for (int j = i - 1; j >= 0; j--)
- if (DP[j] + 1 > DP[i] && array[j] < array[i])
- {
- DP[i] = DP[j] + 1;
- prev[i] = j;
- }
- if (DP[i] > maxLength)
- {
- bestEnd = i;
- maxLength = DP[i];
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement