https://vjudge.net/problem/HDU-4122
题意:Alice有一家24小时营业的月饼店,2000年1月1日0点是她营业的第一个小时,Alice会营业m个小时,每个小时的月饼造价不同,造的月饼可以当天卖掉或者放在冰箱(最多存放T小时),一个月饼存放一个小时的花费是S。她有n个订单,求完成这些订单的最小花费。
思路:i时刻的订单可以在[i-T,i]中任何一个时间点完成,考虑到冰箱存放的额外花费,每相邻的两个时间点的额外花费相差S,所以我们可以先在每个月饼造价上加上(m-i)* S,然后时刻i每一个月饼的最小花费就是 [i-T,i]中的最小值减去i*S
1、单调队列维护最小值
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<string>
#include<vector>
using namespace std;
#define LL long long
#define uLL unsigned long long
#define PII pair<int,int>
#define int long long
const int manx=1e5+10;
const int INF=0x3f3f;
int sumy[60];
int M[]= {0,31,28,31,30,31,30,31,31,30,31,30,31};
int head,tail,q[manx],num[manx],cost[manx],cost1[manx];
int check(int x)
{
return (x%4==0&&x%100!=0)||x%400==0;
}
signed main()
{
char mon[5];
int date,year,H,R,n,m,T,S;
map<string,int>mp;
for(int i=2000; i<=2050; i++)
{
if(check(i))
sumy[i-2000+1]=366+sumy[i-2000];
else sumy[i-2000+1]=365+sumy[i-2000];
}
for(int i=1; i<=12; i++)
M[i]=M[i]+M[i-1];
mp["Jan"]=1,mp["Feb"]=2,mp["Mar"]=3,mp["Apr"]=4,mp["May"]=5,mp["Jun"]=6;
mp["Jul"]=7,mp["Aug"]=8,mp["Sep"]=9,mp["Oct"]=10,mp["Nov"]=11,mp["Dec"]=12;
while(scanf("%lld%lld",&n,&m),m||n)
{
memset(num,0,sizeof num);
for(int i=1;i<=n;i++)
{
scanf("%s%lld%lld%lld%lld",mon,&date,&year,&H,&R);
int Mon=mp[mon];
int temp=sumy[year-2000]+M[Mon-1]+date-1;
if(Mon>2&&check(year))temp++;
temp*=24;
temp+=H+1;
num[temp]+=R;
}
scanf("%lld%lld",&T,&S);
for(int i=1;i<=m;i++)
scanf("%lld",&cost[i]);
for(int i=1;i<=m;i++)
{
cost1[i]=(m-i)*S;
cost[i]+=cost1[i];
}
int ans=0;
tail=0,head=1;
for(int i=1;i<=m;i++)
{
while(head<=tail&&q[head]<i-T)head++;
while(head<=tail&&cost[q[tail]]>cost[i])tail--;
q[++tail]=i;
ans+=num[i]*(cost[q[head]]-cost1[i]);
}
printf("%lld\n",ans);
}
return 0;
}
2、RMQ查询区间最小值
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<string>
#include<vector>
using namespace std;
#define LL long long
#define uLL unsigned long long
#define PII pair<int,int>
#define int long long
const int manx=1e5+10;
const int INF=0x3f3f;
int sumy[60];
int M[]= {0,31,28,31,30,31,30,31,31,30,31,30,31};
int dp_min[manx][30],num[manx],cost[manx],cost1[manx];
int check(int x)
{
return (x%4==0&&x%100!=0)||x%400==0;
}
int query(int l,int r)
{
int k=log2(r-l+1);
return min(dp_min[l][k],dp_min[r-(1<<k)+1][k]);
}
signed main()
{
char mon[5];
int date,year,H,R,n,m,T,S;
map<string,int>mp;
for(int i=2000; i<=2050; i++)
{
if(check(i))
sumy[i-2000+1]=366+sumy[i-2000];
else sumy[i-2000+1]=365+sumy[i-2000];
}
for(int i=1; i<=12; i++)
M[i]=M[i]+M[i-1];
mp["Jan"]=1,mp["Feb"]=2,mp["Mar"]=3,mp["Apr"]=4,mp["May"]=5,mp["Jun"]=6;
mp["Jul"]=7,mp["Aug"]=8,mp["Sep"]=9,mp["Oct"]=10,mp["Nov"]=11,mp["Dec"]=12;
while(scanf("%lld%lld",&n,&m),m||n)
{
memset(num,0,sizeof num);
for(int i=1;i<=n;i++)
{
scanf("%s%lld%lld%lld%lld",mon,&date,&year,&H,&R);
int Mon=mp[mon];
int temp=sumy[year-2000]+M[Mon-1]+date-1;
if(Mon>2&&check(year))temp++;
temp*=24;
temp+=H+1;
num[temp]+=R;
}
scanf("%lld%lld",&T,&S);
for(int i=1;i<=m;i++)
scanf("%lld",&cost[i]);
for(int i=1;i<=m;i++)
{
cost1[i]=(m-i)*S;
cost[i]+=cost1[i];
}
for(int i=1;i<=m;i++)
dp_min[i][0]=cost[i];
for(int j=1;j<=20;j++)
for(int i=1;i+(1<<j)-1<=m;i++)
dp_min[i][j]=min(dp_min[i][j-1],dp_min[i+(1<<(j-1))][j-1]);
int ans=0;
for(int i=1;i<=m;i++)
{
if(num[i])
ans+=num[i]*(query(max(i-T,1ll),i)-cost1[i]);
}
printf("%lld\n",ans);
}
return 0;
}