Second My Problem First (单调队列入门）

https://cn.vjudge.net/problem/HDU-3706

Give you three integers n, A and B. 
Then we define S i = A i mod B and T i = Min{ S k | i-A <= k <= i, k >= 1} 
Your task is to calculate the product of T i (1 <= i <= n) mod B.

Input

Each line will contain three integers n(1 <= n <= 10 7),A and B(1 <= A, B <= 2 31-1). 
Process to end of file.

Output

For each case, output the answer in a single line.

Sample Input

1 2 3
2 3 4
3 4 5
4 5 6
5 6 7

Sample Output

2
3
4
5
6

思路：维护一个单调递增的单调队列，队首下标不符合条件就把队首出列，队尾如果值大于等于当前值就把队尾出列

#include<bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
typedef long long ll;
struct node{
	ll x;
	int id;
};
deque<node> q;
int main(){
    int n,A,B;
    while(~scanf("%d%d%d",&n,&A,&B)){
    	q.clear();
    	ll ans=1,a=1;
    	for(int i=1;i<=n;i++){
    		a=a*A%B;
    		while(!q.empty()&&q.front().id<i-A) q.pop_front();
    		while(!q.empty()&&q.back().x>=a) q.pop_back();
    		q.push_back(node{a,i});
    		ans=ans*q.front().x%B;
		}
		printf("%lld\n",ans);
	}
	return 0;
}