poj 3186 Treats for the Cows
来源:互联网 发布:ip 网络层 编辑:程序博客网 时间:2024/04/25 14:02
dp
正数第i个,倒数第j个;
dp[i][j]=max(dp[i-1][j]+val[i]*(i+j),dp[i][j-1]+val[n-j+1]*(j+i);
#include <iostream>#include <cstdio>using namespace std;int val[2005];int dp[2005][2005];int main(){// freopen("in","r",stdin); int n; while(cin>>n) { for(int i=1;i<=n;i++) { scanf("%d",&val[i]); } int _max=0; int i,j; for(i=0;i<=n;i++) { for(j=0;j+i<=n;j++) { if(i==0&&j==0) dp[i][j]=0; else if(i==0&&j!=0) dp[i][j]=max(dp[i][j],dp[i][j-1]+val[n-j+1]*(i+j)); else if(i!=0&&j==0) dp[i][j]=max(dp[i][j],dp[i-1][j]+val[i]*(i+j)); else dp[i][j]=max(dp[i-1][j]+val[i]*(i+j),dp[i][j-1]+val[n-j+1]*(i+j)); } } for(i=0;i<=n;i++) { if(_max<dp[i][n-i]) { _max=dp[i][n-i]; } } printf("%d\n",_max); } return 0;}
0 0
- POJ 3186 Treats for the Cows
- poj(3186)Treats for the Cows
- poj 3186 Treats for the Cows
- POJ 3186 Treats for the Cows
- POJ 3186 Treats for the Cows
- POJ 3186 Treats for the Cows (DP)
- POJ 3186 Treats for the Cows
- POJ 3186 Treats for the Cows
- POJ 3186Treats for the Cows
- POJ-3186-Treats for the Cows
- POJ - 3186----Treats for the Cows
- POJ 3186 Treats for the Cows
- POJ 3186 Treats for the Cows
- poj 3186 Treats for the Cows
- POJ-3186 Treats for the Cows
- POJ 3186 Treats for the Cows 笔记
- POJ-3186-Treats for the Cows
- Treats for the Cows POJ
- 一群牛人翻译:The Swift Programming Language 中文版
- TCP滑动窗口机制
- lucene对文件做简单的索引
- 阿什福倒萨戴菲菲抗虫棉的速度vsdvglksdbv克里斯蒂不vsldkbvsksdklsdvk
- MySQL内存使用-全局共享
- poj 3186 Treats for the Cows
- Javascript 初学者应知的 24 条最佳实践
- 利用tom的SHOW_SPACE脚本实验验证表插入删除带来的redo和工作原理
- 加不加
- extjs4.2 动态加载树 treePanel
- 为服务器程序增加清理僵尸进程机制
- ORA-09925: Unable to create audit trail file引发的错误
- 【有源码】ViewPager+Fragment+RadioButton替代TabActivity
- 《Linux设备驱动开发详解》-- 内核定时器