update

src/8/24/P1020.cpp

@@ -19,9 +19,9 @@ int main(){
     }
 
     std::vector<ll> f(v.size() + 1, 0);
-    f[1] = v[0];
+    f[1] = v[0]; // f[i]=最长不上升子序列中长度为i结尾的数字最大的
     ll maxdp = 1;
-
+    
     for (ll i = 1; i < v.size(); i++) {
         ll h = v[i];
         ll l = 1, r = maxdp, ans = 0;