解题思路:
注意事项:
参考代码:
T, M = map(int, input().split())
grass_time = []
grass_value = []
for _ in range(M):
this_time, this_value = map(int, input().split())
grass_time.append(this_time)
grass_value.append(this_value)
station = [[0] * (T + 1) for _ in range(M)]
for i in range(M):
for j in range(T + 1):
if grass_time[i] <= j:
station[i][j] = max(station[i - 1][j], grass_value[i] + station[i - 1][j - grass_time[i]])
else:
station[i][j] = station[i - 1][j]
print(station[M - 1][T])
0.0分
0 人评分
三角形 (C语言代码)浏览:914 |
1012题解浏览:870 |
C语言程序设计教程(第三版)课后习题7.4 (C语言代码)浏览:450 |
A+B for Input-Output Practice (III) (C语言代码)浏览:424 |
1250题解浏览:561 |
简单的a+b (C语言代码)浏览:454 |
C二级辅导-阶乘数列 (C语言代码)浏览:1779 |
C语言训练-百钱百鸡问题 (C语言代码)浏览:635 |
C语言程序设计教程(第三版)课后习题6.5 (C语言代码)浏览:634 |
C语言程序设计教程(第三版)课后习题6.2 (C语言代码)浏览:434 |