Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <map>#include <set>#include <cmath>#include <queue>#include <ctime>#include <bitset>#include <string>#include <cstdio>#include <vector>#include <fstream>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int maxn = 100000 + 10;const int mod = 1000000007;int n, m, a[maxn], f[maxn], s[maxn];void work() {scanf("%d%d", &n, &m);for (int i = 0; i < n; i ++) {scanf("%d", &a[i]);}for (int i = 1; i <= m; i ++) {f[i] = 1;}for (int i = 1; i < n; i ++) {if (a[i] == a[i - 1]) continue;if (a[i] > a[i - 1]) {for (int j = 1; j <= m; j ++) {