1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T71b,#include "testlib.h" #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // small size int n = rnd.next(1, 10); // pick generation type int type = rnd.next(0, 4); vector a(n); if (type == 0) { // random with duplicates, weighted bias int t = rnd.next(-1, 1); for (int i = 0; i < n; i++) { a[i] = 1 + rnd.wnext(n, t); } } else if (type == 1) { // strictly increasing for (int i = 0; i < n; i++) a[i] = i + 1; } else if (type == 2) { // strictly decreasing for (int i = 0; i < n; i++) a[i] = n - i; } else if (type == 3) { // plateau blocks int blocks = rnd.next(1, min(n, 3)); // distinct values vector vals; while ((int)vals.size() < blocks) { int v = rnd.next(1, n); bool ok = true; for (int x : vals) if (x == v) { ok = false; break; } if (ok) vals.push_back(v); } // order blocks if (rnd.next(0,1) == 0) sort(vals.begin(), vals.end()); else sort(vals.begin(), vals.end(), greater()); // block sizes vector bs(blocks, 1); int rem = n - blocks; for (int i = 0; i < rem; i++) { bs[rnd.next(0, blocks-1)]++; } int pos = 0; for (i

코드 #3578