UESTC-594 我要长高（动态规划＋单调队列优化）

#include 
#include 
#include 
#include 
using namespace std;#define INFS 0x3fffffff
#define BG 50005int dp[2][105];//because the best height of current one is influenced by the previous one and his real height,we must hold a dp list meaning cost of all his possible height for the next person to refer to.And this list is also generated by the nest value of function--nowf(about all the variables of last person).
int q[105];//And this best value is token by Monotonous Queue Optimization method.
int main()
{int n,c;int cur;int nowf=0;while(cin>>n>>c)//scanf("%d%d",&n,&c)!=EOF){int i,j;int res=INFS;int tail,head;int x=0;cur=0;scanf("%d",&x);memset(q,0,sizeof(int)*105);for(j=1;j>x;//suppose the current one is taller than the previous one.tail=head=0;//the queue q[105] is refreshed twice every time(i).for(j=1;j<=100;j++)//j is from 1 to 100{nowf=dp[1-cur][j]-c*j;//the previous onewhile(nowf=1;j--)//j is from 100 to 1(because the previous one is taller){nowf=dp[1-cur][j]+c*j;while(nowf=x)//the occasion where j

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！