BraketBN

原理证明看的http://blog.csdn.net/zy691357966/article/details/39854359比较简单优美的算法，就找了个模板题做了下。注意输出格式...否则PE#include #include using namespace std;const int maxn = 600005;int n, s[maxn];

模板。#include #include #include using namespace std;const int maxn = 200005;int n;char s[maxn];int MR() { int i = 0, j = 1; for(int k; i < n && j < n; ) { k = 0; for(; k < n && s[

模板。#include #include #include using namespace std;const int maxn = 200005;int n;char s[maxn];int MR() { int i = 0, j = 1; for(int k; i < n && j < n; ) { k = 0; for(; k < n && s[