Wizmann

function getScrollHeight(a){return void 0!==a[0].scrollHeight?a[0].scrollHeight:void 0!==a.find("html")[0].scrollHeight&&0!==a.find("html")[0].scrollHeight?a.find("html")[0].scrollHeight:a.find("body")[0].scrollHeight}function syncPreview(){var a=window.ace.edit("editor"),b=$("#preview"),c=a.getSession().getLength()-a.getLastVisibleRow()+a.getFirstVisibleRow(),d=getScrollHeight(b),e=a.getFirstVisibleRow()/c;setTimeout(function(){b.scrollTop(e*(d-b.height()))})}$(function(){function a(a,b){!function(c,d){var e=c.createElement(d),f=c.getElementsByTagName(d)[0];e.async=1,e.src=a,f.parentNode.insertBefore(e,f),e.onload=function(){b&&b()}}(document,"script")}function b(){var a;try{localStorage.getItem&&(a=localStorage)}catch(b){}return a}function c(){var a;try{a=JSON.parse(localStorage.profile),a=$.extend(!0,W,a)}catch(b){a=W}W=a}function d(a){localStorage.profile=JSON.stringify($.extend(!0,W,a))}function e(a){return g(a,"pfx")}function f(a,b){for(var c in a)if(void 0!==Z[a[c]])return"pfx"===b?a[c]:!0;return!1}fun

Wizmann

[hidden]{display:none}::-moz-selection{background:#087185;color:#fff;text-shadow:none}::selection{background:#087185;color:#fff;text-shadow:none}a:visited{color:#551a8b}b{font-weight:700}dfn{font-style:italic}hr{display:block;height:1px;border:0;border-top:1px solid #ccc;margin:1em 0;padding:0}ins{background:#ff9;color:#000;text-decoration:none}mark{background:#ff0;color:#000;font-style:italic;font-weight:700}pre,code,kbd,samp{font-family:monospace,serif;_font-family:'courier new',monospace}kbd,samp{font-size:1em}pre{word-wrap:break-word}q{quotes:none}q:before,q:after{content:none}nav ul,nav ol,list-style:none{list-style-image:none;margin:0;padding:0}img{vertical-align:middle}svg:not(:root){overflow:hidden}figure{margin:0}label{cursor:pointer}legend{*margin-left:-7px;white-space:normal}button,input[type=button],input[type=reset],input[type=submit]{*overflow:visible}button[disabled],input[disabled]{cursor:default}input[type=checkbox],input[type=radio]{box-sizing:border-box;padding:0;*width:13px;*height:13px}te

Wizmann

#include <cstdio>
#include <iostream>
#include <ctime>
#include <cassert>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>

Wizmann

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

#define print(x) cout << x << endl

Wizmann

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define print(x) do {cout << x << endl;} while(0)
#define input(x) do {cin >> x;} while(0)

Wizmann

print 'Hello World!'

Wizmann

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <unordered_map>

using namespace std;

Wizmann

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

#define input(x) cin >> x

Wizmann

最长后辍匹配 Max suffix match

Description

最长后辍匹配指的是在一个单词中，一个任意非后辍的子串与后辍的最长匹配。

如单词banana，其最长后辍匹配为:b"ana"na和ban"ana"。（引号内的部分即为匹配的部分）

所以，MaxSuffixMatch("banana") = 3。

Wizmann

#include "KVTree.hpp"

void TreeIterator::next() {
    return;
}

bool TreeIterator::has_next() {
    while (!_stack.empty() || _cur) {
        if (_cur == nullptr) {
            _cur = _stack.top();