'commit'

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_dfs.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+/*
+测试用例：
+5
+12321
+
+*/
+int cnt = 1;
+
+// 递归写法
+void dfs(string s) {
+    int p;
+    for (p = s.size() - 1; p; p--)
+        if (s[0] != s[p]) break;
+    string t = s.substr(1, p);
+    if (t.size()) cnt++, dfs(t);
+}
+
+int main() {
+    int n;
+    string s;
+    cin >> n >> s;
+    dfs(s);
+    cout << cnt << endl;
+    return 0;
+}

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_while.cpp

@@ -23,15 +23,6 @@ void cut(string s) {
     }
 }
 
-// 递归写法
-void dfs(string s) {
-    int p;
-    for (p = s.size() - 1; p; p--)
-        if (s[0] != s[p]) break;
-    string t = s.substr(1, p);
-    if (t.size()) cnt++, dfs(t);
-}
-
 int main() {
     int n;
     string s;

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/hags.cpp

@@ -3,8 +3,8 @@ using namespace std;
 const int N = 10010;
 int a[N];
 int sum, avg, total;
-int n;
 int main() {
+    int n;
     cin >> n;
     for (int i = 1; i <= n; i++) {
         cin >> a[i];
@@ -15,24 +15,25 @@ int main() {
         exit(0);
     }
     avg = sum / n;
+
     for (int i = 1; i <= n; i++) {
         int d = a[i] - avg;
         total += abs(d);
-        int j = i + 1;
+        for (int j = 1 + i; j <= n; j++) {
-        while (d != 0 && j <= n) {
             if (d > 0 && a[j] < avg) {
                 int x = min(d, avg - a[j]);
                 a[i] -= x;
                 a[j] += x;
                 d -= x;
             }
-             if (d < 0 && a[j] > avg) {
+
-                int x = min(-d,a[j]-avg);
+            if (d < 0 && a[j] > avg) {
+                int x = min(d,  a[j]-avg);
                 a[i] += x;
                 a[j] -= x;
                 d += x;
             }
-            j++;
+            if (d == 0) break;
         }
     }
     cout << total << endl;