#PU902. USACO 2019 January Contest, Platinum — Problem 3. Train Tracking 2
USACO 2019 January Contest, Platinum — Problem 3. Train Tracking 2
USACO 2019 January Contest, Platinum — Problem 3. Train Tracking 2
题目描述
Every day the express train goes past the farm. It has carriages (), each with a positive integer label between and ; different carriages may have the same label. Usually, Bessie watches the train go by, tracking the carriage labels. But today is too foggy, and Bessie can't see any of the labels! Luckily, she has acquired the sliding window minimums of the sequence of carriage labels, from a reputable source in the city. In particular, she has a positive integer , and positive integers , where is the minimum label among carriages . Help Bessie figure out the number of ways to assign a label to each carriage, consistent with the sliding window minimums. Since this number may be very large, Bessie will be satisfied if you find its remainder modulo . Bessie's information is completely reliable; that is, it is guaranteed that there is at least one consistent way to assign labels.
输入格式
The first line consists of two space-separated integers, and . The subsequent lines contain the sliding window minimums , one per line.
输出格式
A single integer: the number of ways, modulo , to assign a positive integer not exceeding to each carriage, such that the minimum label among carriages is for each .
数据范围
(见题面原文)
样例
样例 1
4 2
999999998
999999999
999999998
3
Problem credits: Dhruv Rohatgi