HDU3706Second My Problem First(单调队列)

Second My Problem First

Time Limit: 12000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1928    Accepted Submission(s): 731

Problem Description

Give you three integers n, A and B. 
Then we define S _i = A ⁱ 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 ⁷),A and B(1 <= A, B <= 2 ³¹-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>
using namespace std;
typedef long long ll;
ll n, a, b;
deque<pair<int, ll> > q;
int main()
{
    int n;
    while(cin >> n >> a >> b)
    {
        q.clear();
        ll ans = 1, tmp = 1;
        for(int i = 1; i <= n; i++)
        {
            tmp = tmp * a % b;
            while(!q.empty() && q.back().second >= tmp) q.pop_back();
            q.push_back(make_pair(i, tmp));
            while(!q.empty() && i - q.front().first > a) q.pop_front();
            ans = ans * q.front().second % b;
        }
        cout << ans << endl;
    }
    return 0;
}