huanghai/python
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

'commit'

Browse Source
This commit is contained in:
HuangHai
2025-10-05 19:16:56 +08:00
parent 573c77674e
commit 88a4852812
3 changed files with 139 additions and 91 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
TangDou/CSP-J/AcWingTraining/T1/442_3.cpp Normal file
View File

@@ -0,0 +1,30 @@
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 10010; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
const int MAX_M = 110; // <20><><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ<EFBFBD><CDB7>
int n, m; // n: ͬѧ<CDAC><D1A7><EFBFBD><EFBFBD>, m: ˮ<><CBAE>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD>
int w[MAX_N]; // ÿλͬѧ<CDAC>Ľ<EFBFBD>ˮ<EFBFBD><CBAE>
int taps[MAX_M]; // ÿ<><C3BF>ˮ<EFBFBD><CBAE>ͷ<EFBFBD>ĵ<EFBFBD>ǰ<EFBFBD><C7B0><EFBFBD><EFBFBD>ʱ<EFBFBD><CAB1>
int main() {
cin >> n >> m;
// ģ<><C4A3><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE><EFBFBD><EFBFBD>
for (int i = 0; i < n; i++) {
cin >> w[i];
// <20>ҵ<EFBFBD><D2B5><EFBFBD><EFBFBD>Ƚ<EFBFBD><C8BD><EFBFBD><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ
int min_tap = 0;
for (int j = 1; j < m; j++)
if (taps[j] < taps[min_tap])
min_tap = j;
// <20><>i<EFBFBD><69>ͬѧ<CDAC>Ľ<EFBFBD>ˮ<EFBFBD><CBAE><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ƚ<EFBFBD><C8BD><EFBFBD><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ
taps[min_tap] += w[i];
}
// <20>ҵ<EFBFBD><D2B5><EFBFBD><EFBFBD><EFBFBD>ˮ<EFBFBD><CBAE>ͷ<EFBFBD><CDB7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ľ<EFBFBD><C4BD><EFBFBD>ʱ<EFBFBD><CAB1>
int result = 0;
for (int i = 0; i < m; i++)
result = max(result, taps[i]);
cout << result << endl;
return 0;
}