Dynamic Programming / en: pseudocode is incomplete

Unless I'm mistaken, the `if` statement at the bottom of the Longest Subsequence pseudocode doesn't actually do anything:

```
for i=0 to n-1
LS[i]=1
for j=0 to i-1
if (a[i] > a[j] and LS[i]

Open the English Dynamic Programming documentation and locate the Longest Subsequence pseudocode shown in the issue. Read the surrounding explanation to determine what the final comparison is meant to produce, then update the pseudocode so the final block is complete and no statement remains a no-op.

由索引模型根据 Issue 内容生成。