1 solutions
-
0
C++ :
#include <bits/stdc++.h> using namespace std; int n; int a[1005]; int dp[1005];//dp[i]表示i个人的最大积极度 int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } //完全背包求最大值 for(int i=1;i<=n;i++){//外层循环每种分组人数 for(int j=i;j<=n;j++){//内层循环人数 dp[j]=max(dp[j],dp[j-i]+a[i]); } } cout<<dp[n]; return 0; }
- 1
Information
- ID
- 106
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By