codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1102E.md (1413B)


      1 Source: https://codeforces.com/problemset/problem/1102/E
      2 
      3 E. Monotonic Renumeration
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You are given an array $a$ consisting of $n$ integers. Let's denote monotonic renumeration of array $a$ as an array $b$ consisting of $n$ integers such that all of the following conditions are met:
     22 
     23 * $b_1 = 0$;
     24 * for every pair of indices $i$ and $j$ such that $1 \le i, j \le n$, if $a_i = a_j$, then $b_i = b_j$ (note that if $a_i \ne a_j$, it is still possible that $b_i = b_j$);
     25 * for every index $i \in [1, n - 1]$ either $b_i = b_{i + 1}$ or $b_i + 1 = b_{i + 1}$.
     26 
     27 For example, if $a = [1, 2, 1, 2, 3]$, then two possible monotonic renumerations of $a$ are $b = [0, 0, 0, 0, 0]$ and $b = [0, 0, 0, 0, 1]$.
     28 
     29 Your task is to calculate the number of different monotonic renumerations of $a$. The answer may be large, so print it modulo $998244353$.
     30 
     31 Input
     32 
     33 The first line contains one integer $n$ ($2 \le n \le 2 \cdot 10^5$) — the number of elements in $a$.
     34 
     35 The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$).
     36 
     37 Output
     38 
     39 Print one integer — the number of different monotonic renumerations of $a$, taken modulo $998244353$.
     40 
     41 Examples
     42 
     43 Input
     44 
     45 ```
     46 5
     47 1 2 1 2 3
     48 ```
     49 
     50 Output
     51 
     52 ```
     53 2
     54 ```
     55 
     56 Input
     57 
     58 ```
     59 2
     60 100 1
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 2
     67 ```
     68 
     69 Input
     70 
     71 ```
     72 4
     73 1 3 3 7
     74 ```
     75 
     76 Output
     77 
     78 ```
     79 4
     80 ```