B. Alphabetical Strings

https://codeforces.com/contest/1547/problem/B
STL yyds
在这里插入图片描述
INPUT

11
a
ba
ab
bac
ihfcbadeg
z
aa
ca
acb
xyz
ddcba

OUTPUT

YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO

题意
给N,给N个字符串,(有点难说,看图)(我知道表述很水,但来看题解了应该都懂题目叭)在这里插入图片描述
反正从a-z顺序从‘a’起始放字母 且必须在串的左右(建议看题目,太菜了表达不了无法表述)

解题思路
采用STL的deque容器,其特质是可以任意从头和尾加入或去除(好像queue也行。。。),将字符串放入队列,然后从 ’z‘ 至 “a” 由外向里拨开字符串。详情见代码。

AC代码

#include <deque>
#include <iostream>
using namespace std;

bool isalpha(string a)
{
	deque<char> str;
	for (auto c : a)
	{
		str.emplace_back(c);		//存入
	}
	for (int i(a.length() - 1); i >= 0; --i)
	{
		if ('a' + i == str.front())		//判断前面是否是否合理
			str.pop_front();
		else if ('a' + i == str.back())		//判断后面是否字符串合理
			str.pop_back();
		else						//出问题(没找到对应该有的字符)则直接输出false了
			return false;
	}
	return true;
}

int main()
{
	string x;
	int t;
	cin >> t;
	while(t--)
	{
		cin >> x;
		cout << (isalpha(x) ? "YES" : "NO") << endl;
	}
	return 0;
}

STL yyds
如有问题请指正,本人虚心受教

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Description Consider the following 5 picture frames placed on an 9 x 8 array. ........ ........ ........ ........ .CCC.... EEEEEE.. ........ ........ ..BBBB.. .C.C.... E....E.. DDDDDD.. ........ ..B..B.. .C.C.... E....E.. D....D.. ........ ..B..B.. .CCC.... E....E.. D....D.. ....AAAA ..B..B.. ........ E....E.. D....D.. ....A..A ..BBBB.. ........ E....E.. DDDDDD.. ....A..A ........ ........ E....E.. ........ ....AAAA ........ ........ EEEEEE.. ........ ........ ........ ........ 1 2 3 4 5 Now place them on top of one another starting with 1 at the bottom and ending up with 5 on top. If any part of a frame covers another it hides that part of the frame below. Viewing the stack of 5 frames we see the following. .CCC.... ECBCBB.. DCBCDB.. DCCC.B.. D.B.ABAA D.BBBB.A DDDDAD.A E...AAAA EEEEEE.. In what order are the frames stacked from bottom to top? The answer is EDABC. Your problem is to determine the order in which the frames are stacked from bottom to top given a picture of the stacked frames. Here are the rules: 1. The width of the frame is always exactly 1 character and the sides are never shorter than 3 characters. 2. It is possible to see at least one part of each of the four sides of a frame. A corner shows two sides. 3. The frames will be lettered with capital letters, and no two frames will be assigned the same letter. Input Each input block contains the height, h (h<=30) on the first line and the width w (w<=30) on the second. A picture of the stacked frames is then given as h strings with w characters each. Your input may contain multiple blocks of the format described above, without any blank lines in between. All blocks in the input must be processed sequentially. Output Write the solution to the standard output. Give the letters of the frames in the order they were stacked from bottom to top. If there are multiple possibilities for an ordering, list all such possibilities in alphabetical order, each one on a separate line. There will always be at least one legal ordering for each input block. List the output for all blocks in the input sequentially, without any blank lines (not even between blocks). Sample Input 9 8 .CCC.... ECBCBB.. DCBCDB.. DCCC.B.. D.B.ABAA D.BBBB.A DDDDAD.A E...AAAA EEEEEE.. Sample Output EDABC
最新发布
06-06

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值