From 8aba3d8e3d8077c7efc62c77c5d51e3bca5d3908 Mon Sep 17 00:00:00 2001
From: Zengtudor <Zengtudor@outlook.com>
Date: Thu, 11 Sep 2025 11:46:00 +0800
Subject: [PATCH] =?UTF-8?q?feat:=20=E6=B7=BB=E5=8A=A0P5017=E9=97=AE?=
 =?UTF-8?q?=E9=A2=98=E7=9A=84=E5=8A=A8=E6=80=81=E8=A7=84=E5=88=92=E8=A7=A3?=
 =?UTF-8?q?=E6=B3=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

实现了一个基于深度优先搜索和记忆化的动态规划解决方案，用于解决P5017问题。该算法通过排序输入数据并利用记忆化技术优化计算，有效减少了重复计算，提高了效率。
---
 src/9/11/P5017.cpp | 46 ++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 src/9/11/P5017.cpp

diff --git a/src/9/11/P5017.cpp b/src/9/11/P5017.cpp
new file mode 100644
index 0000000..7e218e2
--- /dev/null
+++ b/src/9/11/P5017.cpp
@@ -0,0 +1,46 @@
+#include <algorithm>
+#include <cstdint>
+#include <iostream>
+#include <istream>
+#include <vector>
+using ll = int64_t;
+
+ll n,m, maxt=0;
+std::vector<ll> t;
+std::vector<std::vector<ll>> mem;
+
+static inline ll dfs(const ll cur,const ll st){
+    if(cur>=n+1)return 0;
+    if(st<t[cur]){
+        return dfs(cur,t[cur]);
+    }
+    if(mem[cur][st-t[cur]]){
+        return mem[cur][st-t[cur]];
+    }
+    ll j=cur;
+    ll sum=0;
+    while(j<=n && t[j]<=st){
+        sum+=t[j++];
+    }
+    ll best=st*(j-cur)-sum+dfs(j,st+m);
+    for(;j<=n;j++){
+        sum+=t[j];
+        best=std::min(best,t[j]*(j-cur+1)-sum+dfs(j+1,t[j]+m));
+    }
+    mem[cur][st-t[cur]]=best;
+    return best;
+}
+
+int main(){
+    std::iostream::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+
+    std::cin>>n>>m;
+    t.resize(n+1);
+    mem.resize(n+1,std::vector<ll>(maxt+m+1));
+    for(ll i=1;i<=n;i++){
+        std::cin>>t[i];
+    }
+    std::sort(t.begin()+1,t.begin()+1+n);
+    std::cout<<dfs(1,0)<<"\n";
+}
\ No newline at end of file