HDU3706-Second My Problem First

Second My Problem First

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

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
  
  

 

Author

WhereIsHeroFrom@HDU

 

Source

HDOJ 5th Anniversary Contest

 

题意：给你一个N A B 
Si = A^i %b，Ti =min(Sk) i-A<=k<=i k>=1，求Ti的乘积modB
解题思路：用单调队列维护i前A长度的最小值

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

#define LL long long
#define MAXN 10000100

LL n,a,b;
int q[MAXN][2];

int main()
{
    while(~scanf("%lld %lld %lld",&n,&a,&b))
    {
        LL ans=1,x=1;
        int head=0,rear=0;
        for(int i=1;i<=n;i++)
        {
            x=x*a%b;
            while(head<rear&&i-q[head][1]>a) head++;
            while(head<rear&&q[rear-1][0]>x) rear--;
            q[rear][0]=(int)x;
            q[rear++][1]=i;
            ans=ans*q[head][0]%b;
        }
        printf("%lld\n",ans);
    }
    return 0;
}