'commit'

LuoGu/RuMen/P1614.cpp

@@ -1,24 +1,23 @@
 #include <bits/stdc++.h>
 
 using namespace std;
-int a[3001] = {0};
+const int N = 3010;
-int _min = 999999;
+const int INF = 0x3f3f3f3f;
+int a[N];
+int mi = INF;
 
 int main() {
-    ios::sync_with_stdio(false); //读入输出优化的强迫症
+  int n, m;
-    int n, m;
+  cin >> n >> m;
-    cin >> n >> m;
+  for (int i = 1; i <= n; i++)
-    for (int i = 1; i <= n; i++) {
+    cin >> a[i];
-        cin >> a[i];
-    }
 
-    for (int i = 1; i <= n - m + 1; i++) {
+  for (int i = 1; i <= n - m + 1; i++) {
-        int sum = 0;
+    int sum = 0;
-        for (int j = 1; j <= m; j++) {
+    for (int j = 0; j < m; j++)
-            sum += a[i + j-1];
+      sum += a[i + j];
-        }
+    mi = min(mi, sum);
-        if (_min > sum) _min = sum;
+  }
-    }
+  cout << mi << endl;
-    cout << _min << endl;
+  return 0;
-    return 0;
 }

TangDou/LuoGuBook/P1614_0.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+const int N = 3010;
+const int INF = 0x3f3f3f3f;
+int a[N];
+int mi = INF;
+
+int main() {
+    int n, m;
+    cin >> n >> m;
+    for (int i = 1; i <= n; i++)
+        cin >> a[i];
+
+    for (int i = 1; i <= n - m + 1; i++) {
+        int sum = 0;
+        for (int j = 0; j < m; j++)
+            sum += a[i + j];
+        mi = min(mi, sum);
+    }
+    cout << mi << endl;
+    return 0;
+}

TangDou/LuoGuBook/P1614_1.cpp

@@ -17,6 +17,6 @@ int main() {
     for (int i = m; i <= n; i++)
         mi = min(mi, s[i] - s[i - m]); // 求定区间和并取最小的一部分
     // 输出最小值
-    printf("%d", mi);
+    cout << mi << endl;
     return 0;
 }