{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cstyle type\u003d\u0027text/css\u0027\u003e .input, .output {border: 1px solid #888888;} .output {margin-bottom:1em;position:relative;top:-1px;} .output pre,.input pre {background-color:#EFEFEF;line-height:1.25em;margin:0;padding:0.25em;} .title {background-color:#FFFFFF;border-bottom: 1px solid #888888;font-family:arial;font-weight:bold;padding:0.25em;} \u003c/style\u003e \u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027]], displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027]]}\n });\n \u003c/script\u003e\n \u003cscript type\u003d\"text/javascript\" async\n src\u003d\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\"\u003e\n \u003c/script\u003e\n\n\u003cp\u003e迈克想在字符串s中找到子串“happiness”,但康斯坦丁不允许,于是决定这么做阻碍他。他计划在字符串s的两个不同位置交换两个字符来让迈克找不到子串“happiness”。君士坦丁应该换哪两个字母?\u003c/p\u003e\n"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e唯一的一行包含小写字母的字符串s(2 \u003c\u003d|s|\u003c\u003d200000)。\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e\n如果康斯坦丁成功地实现了他的目标,在第一行输出\"YES\",不带引号。并在第二个行输出两个由空格分隔的不同整数——描述字符串s中的字符位置,表示康斯坦丁应该交换哪两个不同位置。(字符串中的位置是从1开始编号的。)如果有几种可能的话答案,输出任何一个。\u003c/p\u003e\n\n\u003cp\u003e如果对于康斯坦丁的任何选择,Mike仍然能够在唯一一行中找到子串“happiness”输出”NO“没有引号\u003c/p\u003e"}},{"title":"Input1","value":{"format":"HTML","content":"pursuingthehappiness\n"}},{"title":"Output1","value":{"format":"HTML","content":"YES\n15 18"}},{"title":"Input2","value":{"format":"HTML","content":"happinessformehappinessforyouhappinessforeverybodyfreeandletnoonebeleftbehind\n"}},{"title":"Output2","value":{"format":"HTML","content":"NO"}}]}