From 7d1c562ee04b7f55bd0c7f092e4394c1368cb655 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Sun, 17 Dec 2023 09:06:28 +0800
Subject: [PATCH] 'commit'

---
 TangDou/Topic/PrefixAndSuffix/P3406.cpp | 13 +++++++------
 1 file changed, 7 insertions(+), 6 deletions(-)

diff --git a/TangDou/Topic/PrefixAndSuffix/P3406.cpp b/TangDou/Topic/PrefixAndSuffix/P3406.cpp
index 4376f2e..23ccdfb 100644
--- a/TangDou/Topic/PrefixAndSuffix/P3406.cpp
+++ b/TangDou/Topic/PrefixAndSuffix/P3406.cpp
@@ -2,13 +2,14 @@
 using namespace std;
 #define int long long
 #define endl "\n"
-
+const int N = 100010;
+int n, m, ans;
+int p[N];                   // 用于记录经过站点的顺序
+int t[N];                   // 用于记录站点之间的路径经过的次数
+int a[N], b[N], c[N], x, y; // 用于记录每段路径所花的费用
 signed main() {
-    int n, m, ans = 0;
-    scanf("%lld%lld", &n, &m);
-    int p[m + 1];                           // 用于记录经过站点的顺序
-    int t[n + 1] = {};                      // 用于记录站点之间的路径经过的次数
-    int a[n + 1], b[n + 1], c[n + 1], x, y; // 用于记录每段路径所花的费用
+    cin >> n >> m;
+
     for (int i = 1; i <= m; i++)
         scanf("%lld", &p[i]);
     for (int i = 1; i <= n - 1; i++)