首页 > 代码库 > POJ 3661 Running
POJ 3661 Running
传送
| Time Limit: 1000MS | Memory Limit: 65536K | |
Description
The cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 ≤ N ≤ 10,000) minutes. During each minute, she can choose to either run or rest for the whole minute.
The ultimate distance Bessie runs, though, depends on her ‘exhaustion factor‘, which starts at 0. When she chooses to run in minute i, she will run exactly a distance of Di (1 ≤ Di ≤ 1,000) and her exhaustion factor will increase by 1 -- but must never be allowed to exceed M (1 ≤ M ≤ 500). If she chooses to rest, her exhaustion factor will decrease by 1 for each minute she rests. She cannot commence running again until her exhaustion factor reaches 0. At that point, she can choose to run or rest.
At the end of the N minute workout, Bessie‘s exaustion factor must be exactly 0, or she will not have enough energy left for the rest of the day.
Find the maximal distance Bessie can run.
Input
* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Line i+1 contains the single integer: Di
Output
* Line 1: A single integer representing the largest distance Bessie can run while satisfying the conditions.
Sample Input
5 2534210Sample Output
9Source
1 #include<set> 2 #include<queue> 3 #include<cstdio> 4 #include<cstdlib> 5 #include<cstring> 6 #include<iostream> 7 #include<algorithm> 8 using namespace std; 9 const int M = 510;10 const int N = 10010;11 #define For(i,n) for(int i=1;i<=n;i++)12 #define Rep(i,l,r) for(int i=l;i<=r;i++)13 14 int n,m,dp[N][M],d[N];15 16 void DP(){17 For(i,n){18 Rep(j,0,m){19 if(j==0) dp[i+1][j]=max(dp[i+1][j],dp[i][j]);20 if(j<m) dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+d[i]);21 if(i+j<=n+1) dp[i+j][0]=max(dp[i+j][0],dp[i][j]);22 }23 }24 cout<<dp[n+1][0]<<endl;25 }26 27 int main(){28 scanf("%d%d",&n,&m);29 For(i,n) scanf("%d",&d[i]);30 DP();31 return 0;32 }
POJ 3661 Running