CFrou685 B. Non-Substring Subsequence 【思维】

Hr0d1y has q
queries on a binary string s of length n. A binary string is a string containing only characters ‘0’ and ‘1’.
A query is described by a pair of integers li
, ri (1≤li<ri≤n).
For each query, he has to determine whether there exists a good subsequence in sthat is equal to the substring s[li…ri].

A substring s[i…j] of a string s is the string formed by characters sisi+1…sj.
String a is said to be a subsequence of string b if a can be obtained from b by deleting some characters without changing the order of the remaining characters.
A subsequence is said to be good if it is not contiguous and has length ≥2. For example, if s is “1100110”, then the subsequences s1s2s4 (“1100110”) and s1s5s7 (“1100110”) are good, while s1s2s3 (“1100110”) is not good.

Can you help Hr0d1y answer each query?
Input

The first line of the input contains a single integer t
(1≤t≤100

) — the number of test cases. The description of each test case is as follows.

The first line contains two integers n
(2≤n≤100) and q (1≤q≤100) — the length of the string and the number of queries.
The second line contains the string s.The i-th of the next q lines contains two integers li and ri (1≤li<ri≤n).
Output

For each test case, output q
lines. The i-th line of the output of each test case should contain “YES” if there exists a good subsequence equal to the substring s[li…ri]

, and “NO” otherwise.

You may print each letter in any case (upper or lower).
Example
Input
Copy

2
6 3
001000
2 4
1 3
3 5
4 2
1111
1 4
2 3

Output
Copy

YES
NO
YES
NO
YES

Note

In the first test case, s[2…4]=“010”. In this case s1s3s5 (“001000”) and s2s3s6 (“001000”) are good suitable subsequences, while s2s3s4
(“001000”) is not good.
s[1…3]=“001”. No suitable good subsequence exists.
s[3…5]=“100”. Here s3s5s6 (“001000”) is a suitable good subsequence.

刚开始读错题了。。
题目问的是从原序列中找到一个不连续的子序列,与给定的序列一样。不连续子序列总长度大于2。
思路:搜原序列前l - 1个元素,判断是否有一个元素与s[l]相同;搜r + 1到s.size() - 1的元素,判断是否有一个元素与s[r]相同。若满足其中一个就输出Yes,否则输出No。

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

void solve() {
	int n, m;
	string str;
	cin >> n >> m;
	cin >> str;
	for(int i = 0; i < m; i++) {
		int l, r;
		cin >> l >> r;
		l--, r--;
		int f = 0;
		for(int i = 0; i < l; i++)
			if(str[i] == str[l]) f = 1;
		for(int i = r + 1; i < n; i++)
			if(str[i] == str[r])	f = 1;
		if(f)	cout << "Yes" << endl;
		else	cout << "No" << endl; 
	}
}

int main() {
	int t;
	cin >> t;
	while(t--)
		solve();
	return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值