1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","6706","static/chunks/6706-6cc81d14a1434b93.js","643","static/chunks/app/codes/%5Bid%5D/page-b7567db79e5dba86.js"],"CodeViewer"] 1c:T768,#include "testlib.h" #include #include using namespace std; int main(int argc, char* argv[]) { registerGen(argc, argv, 1); // Sequence length int N = rnd.next(1, 10); vector a(N); // Choose a scenario for diversity int scen = rnd.next(0, 4); if (scen == 0) { // Completely random for (int i = 0; i < N; i++) a[i] = rnd.next(0, 9); } else if (scen == 1) { // One non-decreasing segment int L = rnd.next(1, N); int s = rnd.next(0, N - L); // fill prefix for (int i = 0; i < s; i++) a[i] = rnd.next(0, 9); // build non-decreasing int startVal = rnd.next(0, 9 - (L - 1)); a[s] = startVal; for (int i = s + 1; i < s + L; i++) a[i] = a[i - 1] + rnd.next(0, 1); // fill suffix for (int i = s + L; i < N; i++) a[i] = rnd.next(0, 9); } else if (scen == 2) { // One non-increasing segment int L = rnd.next(1, N); int s = rnd.next(0, N - L); // fill prefix for (int i = 0; i < s; i++) a[i] = rnd.next(0, 9); // build non-increasing int startVal = rnd.next(L - 1, 9); a[s] = startVal; for (int i = s + 1; i < s + L; i++) a[i] = a[i - 1] - rnd.next(0, 1); // fill suffix for (int i = s + L; i < N; i++) a[i] = rnd.next(0, 9); }

코드 #3048