Codeforces Round #564 (Div. 2) C. Nauuo and Cards

链接：https://codeforces.com/contest/1173/problem/C

题意：

Nauuo is a girl who loves playing cards.

One day she was playing cards but found that the cards were mixed with some empty ones.

There are nn cards numbered from 11 to nn, and they were mixed with another nn empty cards. She piled up the 2n2n cards and drew nn of them. The nn cards in Nauuo's hands are given. The remaining nn cards in the pile are also given in the order from top to bottom.

In one operation she can choose a card in her hands and play it — put it at the bottom of the pile, then draw the top card from the pile.

Nauuo wants to make the nn numbered cards piled up in increasing order (the ii-th card in the pile from top to bottom is the card ii) as quickly as possible. Can you tell her the minimum number of operations?

思路：

先考虑能不能直接出完。

再考虑出几个0之后，一起把n张牌出完。

假设第i张牌再第二个数组中的位置是pi，可以得到只有当其处在i-1这个位置时。才能一下n步出完。

得到res = max(res, pi-i+1+n).

代码：

#include <bits/stdc++.h>using namespace std;typedef long long LL;
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
int n, m, k, t;map<int, int> In;
int a[MAXN];int main()
{
//    freopen("test.in", "r", stdin);cin >> n;for (int i = 1;i <= n;i++)cin >> a[i], In[a[i]] = 0;for (int i = 1;i <= n;i++)cin >> a[i], In[a[i]] = i;if (In[1]){int i = 2;for (;In[i] == In[i-1]+1;i++);if(In[i-1] == n){int j;for (j = i;j <= n && In[j] <= j-i;j++);if (j > n){cout << n-i+1 << endl;return 0;}}}int res = 0;for (int i = 1;i <= n;i++)res = max(res, In[i]-i+1+n);cout << res << endl;return 0;
}

转载于:https://www.cnblogs.com/YDDDD/p/10990891.html

Codeforces Round #564 (Div. 2) C. Nauuo and Cards相关推荐

Codeforces Round #564 (Div. 2) A. Nauuo and Votes
链接:https://codeforces.com/contest/1173/problem/A 题意: Nauuo is a girl who loves writing comments. One ...
Codeforces Round #727 (Div. 2) E. Game with Cards dp + 思维
传送门文章目录题意: 思路: 题意: 初始有左右手,上面各有一个数字为000的卡牌,每次都有一个新卡kik_iki,你可以将其放在左手或者右手,使两只手上的卡片范围在[ll,i,rl,i][l_ ...
Codeforces Round #564 (Div. 2)A
A. Nauuo and Votes 题目链接:http://codeforces.com/contest/1173/problem/A 题目 Nauuo is a girl who loves wr ...
Codeforces Round #712 (Div. 2) F. Flip the Cards 思维 + 贪心
传送门文章目录题意: 思路: 题意: 给你nnn张卡片,每张卡片正面写有数字aaa,反面写有数字bbb,[1,2∗n][1,2*n][1,2∗n]之间的整数在这些数字中都恰好出现一次,我们认为这n ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...
构造 Codeforces Round #302 (Div. 2) B Sea and Islands
题目传送门 1 /* 2 题意:在n^n的海洋里是否有k块陆地 3 构造算法:按奇偶性来判断,k小于等于所有点数的一半,交叉输出L/S 4 输出完k个L后,之后全部输出S:) 5 5 10 的例子可以 ...
Codeforces Round #696 (Div. 2) （A ~ E）超高质量题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #696 (Div. 2) (A ~ E)超高质量题解比赛链接:h ...
Codeforces Round #712 Div.2（A ~ F）超高质量题解（每日训练 Day.15 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Codeforces Round #712 Div.2(A ~ F) 题解比赛链接:https:// ...

Codeforces Round #564 (Div. 2) C. Nauuo and Cards

链接：https://codeforces.com/contest/1173/problem/C

题意：

思路：

代码：

Codeforces Round #564 (Div. 2) C. Nauuo and Cards相关推荐

最新文章

热门文章