Algo-Trian

Algorithm/DP-DynamicProgramming/Linear-DP/P1115 最大子段和.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+#include <utility>
+#include <vector>
+#include <climits>
+#include <algorithm>
+using namespace std;
+const int INF = INT_MAX >> 1;
+int main() {
+	int n;
+	cin >> n;
+	vector<int> a(n);
+	vector<int> dp(n + 1, -INF);
+	for (int i = 0; i < n; i++) {
+		cin >> a[i];
+	}
+	dp[0] = 0;
+	for (int i = 1; i < n + 1; i++) {
+		dp[i] = max(dp[i - 1] + a[i - 1], a[i - 1]);
+	}
+	cout << *max_element(dp.begin() + 1, dp.end()) << endl;
+	return 0;
+}

Algorithm/DP-DynamicProgramming/Linear-DP/P12143 [蓝桥杯 2025 省 A] 好串的数目.cpp

@@ -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;
+}

Algorithm/DP-DynamicProgramming/Linear-DP/P2285 [HNOI2004] 打鼹鼠.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <tuple>
+#include <cmath>
+#include <vector>
+#include <algorithm>
+using namespace std;
+//tuple(t, x, y)
+int dist(const tuple<int, int, int>& i, const tuple<int, int, int>& j){
+	return ( abs(get<1>(i) - get<1>(j)) + abs(get<2>(i) - get<2>(j)) );
+}
+int time(const tuple<int, int, int>& i, const tuple<int, int, int>& j){
+	return abs( get<0>(i) - get<0>(j) );
+}
+int main(){
+	int n, m;
+	cin >> n >> m;
+	//n * n, m <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
+	vector<tuple<int, int, int>> ham(m);
+	vector<int> dp(m, 1);
+	for(int i = 0; i < m; i++){
+		int t, x, y;
+		cin >> t >> x >> y;
+		ham[i] = make_tuple(t, x, y);
+	} 
+	//dp[m] = max (<28><><EFBFBD>ߵ<EFBFBD><DFB5><EFBFBD>(t2 - t1 > dist)dp[x] + 1)
+	for(int i = 1; i < m; i++){
+		for(int j = 0; j < i; j++){
+			//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ߵ<EFBFBD><DFB5>͸<EFBFBD><CDB8><EFBFBD> 
+			if(dist(ham[i], ham[j]) <= time(ham[i], ham[j])){
+				dp[i] = max(dp[i], dp[j] + 1);
+			}
+		}
+	} 
+	cout << *max_element(dp.begin(), dp.end()) << endl;
+	return 0;
+}