Algo-Trian

2025-09-21 12:21:50 +08:00
parent 24522486f1
commit 3bde00039c
25 changed files with 842 additions and 0 deletions
--- a/Algorithm/DP-DynamicProgramming/Linear-DP/P12143
+++ b/Algorithm/DP-DynamicProgramming/Linear-DP/P12143
@@ -0,0 +1,31 @@
+#include <iostream>
+#include <vector>
+#include <string>
+using namespace std;
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+    
+	string s;
+    cin >> s;
+    int n = s.size();
+    vector<int> dp(n, 1);
+    //dp[i]: <20><>i<EFBFBD><69>β<EFBFBD><CEB2><EFBFBD><EFBFBD><EEB3A4><EFBFBD><EFBFBD><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD>
+    //<2F><><EFBFBD><EFBFBD><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӵ<EFBFBD><D3B4><EFBFBD>Ȼ<EFBFBD><C8BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ַ<EFBFBD><D6B7><EFBFBD>
+    //Ԥ<><D4A4><EFBFBD><EFBFBD>
+    for(int i = 1; i < n; i++){
+        if(s[i] == s[i - 1] + 1 || s[i] == s[i - 1]){
+            dp[i] = dp[i - 1] + 1;
+        }
+    }
+    //<2F><><EFBFBD><EFBFBD>Ҫ<EFBFBD>ݳ⣬<DDB3><E2A3AC>ô<EFBFBD>ֶ<EFBFBD><D6B6><EFBFBD><EFBFBD><EFBFBD>
+    int sum = 0;
+    for(int i = 0; i < n; i++){
+        //<2F>Լ<EFBFBD><D4BC><EFBFBD> 
+        sum += (dp[i] - 1) * dp[i] / 2;
+        //ǰ<><C7B0>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> 
+        sum += dp[i] * (i - dp[i]);
+    }
+    cout << sum << endl;
+	return 0;
+}