#include<stdio.h>
#include<string.h>
char james(char s[]) {
int len = strlen(s),flag;
char str[5];
for (int i = 0; i < len; i++) {
flag = 5;
if (s[i] == 'J') {
str[0] = s[i...
单调队列 维护2*j-b[j] b[j]:从j开始能够伸长到哪里
/*
单调队列
*/
#include<iostream>
#include<cstdio>
using namespace std;
int n,s,head=0,tail=-1;
int a[100010],b[100010],q[200010],a...
