void solve() { int n; std::cin >> n; std::vector<int> a(n + 1), mp(n + 2); for (int i = 1; i <= n; i ++) std::cin >> a[i]; i64 ans, sum = 0; std::deque<PII> q; for (int i = 1, mex = 0; i <= n; i ++) { mp[a[i]] ++; while (mp[mex]...
1391C-CyclicPermutations.cpp 1393A-RainbowDashFluttershyAndChessColoring.cpp 1393B-ApplejackAndStorages.cpp 1393C-PinkiePieEatsPattyCakes.cpp 1395A-BoboniuLikesToColorBalls.cpp 1395B-BoboniuPlaysChess.cpp 1398A-BadTriangle.cpp 1399A-RemoveSmallest.cpp 1399B-GiftsFixing.cpp 1399C-BoatsCompetition.cpp ...