hdu 5495 Fxx and game（dp+单调队列优化）

#include <iostream>
#include <string>
#include <cstring>
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
#define maxn 1000005
#define inf 0x3f3f3f3f
template <typename Item>struct monotone_queue
{
std::deque<Item> data,aux;//原本队列之外的辅助队列
int size(){return data.size();}
void push(Item it)
{
data.push_back(it);
while(!aux.empty() && aux.back()>it)aux.pop_back();
aux.push_back(it);
}
void pop()
{
if(data.front() == aux.front())aux.pop_front();
data.pop_front();
}
Item top()
{
return aux.front();
}
void init(){
data.clear();
aux.clear();
}
};
int dp[maxn];
int main()
{
int T,t,x,k;
cin>>T;
monotone_queue<int> mq;

while(T--){
cin>>x>>k>>t;
mq.init();
memset(dp,0,sizeof(dp));
dp[1]=0;
mq.push(dp[1]);
for(int i=2;i<=x;i++){
dp[i]=mq.top()+1;
if(i%k==0) dp[i]=min(dp[i],dp[i/k]+1);
mq.push(dp[i]);
if(mq.size()>t) mq.pop();
}
cout<<dp[x]<<endl;
}
return 0;
}