Datasets:
Upload test file test_easy_d2_n200_seed1001.jsonl
Browse files
test/test_easy_d2_n200_seed1001.jsonl
ADDED
|
@@ -0,0 +1,200 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, -7, -7, 8, 4, 0, -6, -8, -11, 2]\n", "answer": "4"}
|
| 2 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, -8, 2, 1, -2, -7, 9, 1, 1, 1]\n", "answer": "3"}
|
| 3 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [10, 8, -2, -9, 0, -5, 0, -3, 0, -6]\n", "answer": "4"}
|
| 4 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, -11, 8, -9, 6, 7, 4, -8, -4, 7]\n", "answer": "5"}
|
| 5 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, 4, 9, 2, 6, 4, 9, 7, -3, -1]\n", "answer": "4"}
|
| 6 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, 9, 11, -3, 3, -3, -1, 5, 6, 5]\n", "answer": "4"}
|
| 7 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 1, 6, 7, -8, 8, -2, -11, -7, 9]\n", "answer": "5"}
|
| 8 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, -7, 4, 3, -9, 1, -3, 7, 4, 7]\n", "answer": "4"}
|
| 9 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, 1, 1, 9, -9, -10, 5, 3, 1, 5]\n", "answer": "4"}
|
| 10 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, -9, 10, -4, -7, -10, -5, -11, 10, 6]\n", "answer": "4"}
|
| 11 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, 10, 4, -9, -2, -8, -11, 3, -10, -10]\n", "answer": "3"}
|
| 12 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 1, 9, 2, 10, 4, -7, -11, -3, -6]\n", "answer": "3"}
|
| 13 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, 7, -8, -2, 4, 11, -1, 11, 9, 5]\n", "answer": "4"}
|
| 14 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, 2, 10, 0, -3, -5, 0, -3, -5, 0]\n", "answer": "3"}
|
| 15 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, 10, -1, -9, 7, 6, 7, 9, 1, 11]\n", "answer": "6"}
|
| 16 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, 2, 3, -3, -3, 1, -6, 11, -11, 5]\n", "answer": "4"}
|
| 17 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [10, -7, -6, 4, 11, -8, 6, 8, -10, 6]\n", "answer": "5"}
|
| 18 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, -6, -3, 11, 10, 11, 1, 8, -2, -11]\n", "answer": "4"}
|
| 19 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-5, 4, 1, 11, -2, -9, -10, 0, -8, 7]\n", "answer": "4"}
|
| 20 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 5, 3, 5, -8, 8, -2, 7, 5, -4]\n", "answer": "4"}
|
| 21 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -2, -4, 4, 9, -8, 9, 8, -2, 0]\n", "answer": "3"}
|
| 22 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -7, 3, 7, 11, 10, -4, 5, 9, 3]\n", "answer": "4"}
|
| 23 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 9, -5, -1, -3, -8, 11, 3, 2, 4]\n", "answer": "4"}
|
| 24 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, 10, -7, -7, -11, 2, -11, -5, 11, -11]\n", "answer": "3"}
|
| 25 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, 3, -2, 7, 7, -11, 11, -6, 8, -3]\n", "answer": "4"}
|
| 26 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, 11, 1, -10, 1, 3, -7, 7, 4, 0]\n", "answer": "4"}
|
| 27 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, 9, 5, 10, -6, 5, 9, -11, 2, 11]\n", "answer": "5"}
|
| 28 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -3, -8, -9, -1, 0, -5, 3, 4, -2]\n", "answer": "5"}
|
| 29 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, 11, 6, 5, -9, 9, 3, 4, 1, -1]\n", "answer": "3"}
|
| 30 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-7, 4, 2, -3, 9, 1, -9, 6, 11, 9]\n", "answer": "5"}
|
| 31 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, 0, -3, -10, 10, -6, -7, 10, -2, 1]\n", "answer": "4"}
|
| 32 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, -5, -6, -9, -2, -7, -5, -1, 9, 11]\n", "answer": "6"}
|
| 33 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 5, -9, -6, -11, 7, 2, 4, 10, -10]\n", "answer": "5"}
|
| 34 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, -8, 0, 0, -8, -4, -1, 3, 9, 6]\n", "answer": "5"}
|
| 35 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, 3, -5, -1, -9, 5, 3, -6, -5, 1]\n", "answer": "4"}
|
| 36 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, -10, 10, 8, 5, -7, 10, 6, 8, 2]\n", "answer": "4"}
|
| 37 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, 2, -8, 3, -3, 11, -8, 6, -6, 9]\n", "answer": "4"}
|
| 38 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, 7, 0, 1, -1, 6, -7, 3, -7, 6]\n", "answer": "5"}
|
| 39 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, -2, -11, 7, -3, -10, -9, 1, 6, 11]\n", "answer": "6"}
|
| 40 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, -1, -1, 11, -2, 1, 4, -5, -8, 4]\n", "answer": "3"}
|
| 41 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, 6, 4, -8, 7, 7, -7, 11, -8, -8]\n", "answer": "3"}
|
| 42 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, 11, -5, 3, -7, -2, 5, -3, 4, -6]\n", "answer": "3"}
|
| 43 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, -6, 6, 0, 2, -3, -1, -2, -6, -7]\n", "answer": "4"}
|
| 44 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, 11, 10, -6, 3, 11, 8, 5, 4, -9]\n", "answer": "3"}
|
| 45 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, -11, -1, 11, 1, 3, 10, -4, 3, 1]\n", "answer": "5"}
|
| 46 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, 4, -2, -6, 7, -9, 1, 11, -4, 11]\n", "answer": "4"}
|
| 47 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 8, -9, 4, -2, 1, 7, 0, 0, 7]\n", "answer": "4"}
|
| 48 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, -8, 5, 7, 9, 4, -7, 11, 5, 6]\n", "answer": "5"}
|
| 49 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-5, -8, 9, -1, 6, 11, 4, -5, 6, -6]\n", "answer": "4"}
|
| 50 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, -8, -9, 6, 1, -3, -8, 0, 0, 0]\n", "answer": "3"}
|
| 51 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, 10, -11, -11, -8, 1, 3, -11, -9, 8]\n", "answer": "5"}
|
| 52 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, 4, 9, 5, 4, -4, 5, 2, 4, 5]\n", "answer": "5"}
|
| 53 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, -3, -7, -1, -9, 6, 10, -4, 5, 9]\n", "answer": "4"}
|
| 54 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 7, 9, -10, -9, 1, -5, 10, -7, 5]\n", "answer": "4"}
|
| 55 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-3, -6, -8, 4, 11, -1, -7, 7, -8, -3]\n", "answer": "3"}
|
| 56 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, 4, 0, 6, -8, 3, 8, 9, -5, -5]\n", "answer": "4"}
|
| 57 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-3, 5, 10, 0, 6, -7, 3, -9, -10, -1]\n", "answer": "3"}
|
| 58 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, -10, -2, -9, -10, 0, 4, -5, 2, 7]\n", "answer": "5"}
|
| 59 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 10, 6, -6, 5, -2, -7, 7, 10, 7]\n", "answer": "4"}
|
| 60 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -5, 7, -1, -1, 5, 4, -9, -3, 11]\n", "answer": "5"}
|
| 61 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [10, -2, -7, -1, 10, 11, 11, -1, -2, 10]\n", "answer": "4"}
|
| 62 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, -2, 3, 0, 9, -11, -1, 8, -6, -6]\n", "answer": "3"}
|
| 63 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, 6, 0, -2, -9, 4, -4, -2, -8, 8]\n", "answer": "5"}
|
| 64 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-7, -7, 3, -2, -3, -10, -9, 3, 5, 10]\n", "answer": "5"}
|
| 65 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, -10, 9, 4, 2, -10, -8, 8, 3, 4]\n", "answer": "4"}
|
| 66 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, 9, 11, 7, 1, 0, 8, 1, -8, -10]\n", "answer": "3"}
|
| 67 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, -11, -2, 3, -1, -4, -9, 8, 6, 4]\n", "answer": "4"}
|
| 68 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, -10, 3, -8, 4, 4, -2, 6, 11, -4]\n", "answer": "5"}
|
| 69 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, 4, 8, -1, 8, 9, -7, 10, 9, -5]\n", "answer": "5"}
|
| 70 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, -4, 6, 6, -10, 4, -3, 3, 8, 7]\n", "answer": "4"}
|
| 71 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, 10, 0, -10, -8, 5, 1, -1, 0, 10]\n", "answer": "5"}
|
| 72 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, 2, -4, 8, 10, -6, -9, -7, -5, -4]\n", "answer": "4"}
|
| 73 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, 3, 6, 1, 8, -2, -11, -1, 2, -10]\n", "answer": "4"}
|
| 74 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, -8, -11, -8, -8, -11, -7, 9, 11, -4]\n", "answer": "5"}
|
| 75 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 6, 7, -5, 2, -7, 8, -2, 1, -7]\n", "answer": "3"}
|
| 76 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, -7, -6, -1, 6, 5, -3, 9, 3, -1]\n", "answer": "5"}
|
| 77 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, 8, -2, 10, 7, 7, -11, -2, 7, 2]\n", "answer": "3"}
|
| 78 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 7, -6, -8, 11, 9, 3, -9, 4, 7]\n", "answer": "4"}
|
| 79 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -2, 6, -8, 6, -2, -11, 6, 2, 10]\n", "answer": "4"}
|
| 80 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, 4, -9, -7, 10, -6, -5, -3, 5, -1]\n", "answer": "6"}
|
| 81 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 8, -6, -10, -5, 11, -7, 4, 11, -3]\n", "answer": "4"}
|
| 82 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -9, -8, 11, 10, -9, 0, 9, -4, 4]\n", "answer": "4"}
|
| 83 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, -1, 0, -9, 11, 1, 6, 8, 4, 8]\n", "answer": "5"}
|
| 84 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, 7, 0, -11, 11, 5, 7, 11, -1, 1]\n", "answer": "4"}
|
| 85 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, 4, 5, -1, -11, 10, -11, -3, -7, 11]\n", "answer": "5"}
|
| 86 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, -8, 11, -2, -1, -3, 10, -10, -10, 8]\n", "answer": "5"}
|
| 87 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 8, -6, 11, -2, 3, 6, 10, 8, 10]\n", "answer": "6"}
|
| 88 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 4, 8, 7, -3, -2, 7, 1, -3, 11]\n", "answer": "4"}
|
| 89 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -10, -8, 1, 7, 4, -1, -10, -2, 3]\n", "answer": "4"}
|
| 90 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, -11, 5, -9, 6, 8, -5, 2, 9, -10]\n", "answer": "5"}
|
| 91 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 7, 1, 0, 9, 6, 6, 6, 1, 8]\n", "answer": "3"}
|
| 92 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, -7, -11, 10, 4, 4, 10, 11, -5, 9]\n", "answer": "5"}
|
| 93 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, -7, 3, 5, -10, 0, 10, 5, -10, 11]\n", "answer": "5"}
|
| 94 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, 8, -3, 8, -6, -5, -4, -1, -7, -1]\n", "answer": "4"}
|
| 95 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 7, 8, 5, -8, 6, 3, 4, 5, 9]\n", "answer": "5"}
|
| 96 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, 1, 7, 1, -11, 1, 6, 1, -8, 1]\n", "answer": "3"}
|
| 97 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, -1, -1, 10, 8, 3, 2, 5, -3, 3]\n", "answer": "3"}
|
| 98 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [10, 10, -7, 3, 1, -2, 0, -11, 4, 11]\n", "answer": "5"}
|
| 99 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, 0, 6, 3, -11, 1, -4, 6, -9, -2]\n", "answer": "4"}
|
| 100 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -11, 11, 1, -6, 4, -11, 7, 11, 9]\n", "answer": "5"}
|
| 101 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, 5, 1, -1, 2, -6, -6, 6, 1, -4]\n", "answer": "3"}
|
| 102 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -7, 8, 3, -8, -2, -1, 7, -2, -3]\n", "answer": "4"}
|
| 103 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, -8, -6, 11, 1, 7, -4, -10, -8, 6]\n", "answer": "4"}
|
| 104 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 3, 9, 5, 11, -1, -7, -10, 8, 7]\n", "answer": "3"}
|
| 105 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, 2, -2, 5, -1, 3, 3, -6, 6, 2]\n", "answer": "5"}
|
| 106 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 9, 2, -10, 4, -8, -4, -4, 4, -3]\n", "answer": "4"}
|
| 107 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -11, -9, -2, -2, -7, 5, -4, 7, 10]\n", "answer": "6"}
|
| 108 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 6, -4, -3, -4, -10, -4, -4, -6, 9]\n", "answer": "3"}
|
| 109 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 8, -6, -5, -11, 0, -9, -10, 0, 8]\n", "answer": "4"}
|
| 110 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-5, -2, 5, -3, 3, -8, 4, 2, -3, -6]\n", "answer": "4"}
|
| 111 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, -9, 0, -2, 6, 10, -5, -2, -6, -2]\n", "answer": "4"}
|
| 112 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, -3, 5, 2, -10, -3, -1, 9, -8, 10]\n", "answer": "5"}
|
| 113 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-5, 6, 8, -4, 4, -3, -5, -7, 6, 0]\n", "answer": "4"}
|
| 114 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 6, -1, 9, 11, -9, 8, 8, 4, -5]\n", "answer": "4"}
|
| 115 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, -3, -2, 8, 7, -8, -8, 4, -1, 9]\n", "answer": "5"}
|
| 116 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, 4, 8, -2, 11, 4, -5, -1, -5, -1]\n", "answer": "4"}
|
| 117 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, 11, -9, 2, -3, -4, -6, 11, -4, 3]\n", "answer": "4"}
|
| 118 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, -1, -1, -4, 11, 5, 1, -11, 0, 11]\n", "answer": "3"}
|
| 119 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -3, -11, 8, -8, -1, -8, -9, -4, -7]\n", "answer": "3"}
|
| 120 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, 7, -6, -6, 9, -11, 8, -2, 4, -3]\n", "answer": "4"}
|
| 121 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, -6, 4, 6, -7, 1, -7, 1, -3, -2]\n", "answer": "3"}
|
| 122 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, 5, -7, -8, 0, 11, 7, -6, 10, -3]\n", "answer": "5"}
|
| 123 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, -8, -11, -2, -2, 4, 6, -3, 8, 2]\n", "answer": "5"}
|
| 124 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -10, -8, -2, -1, 3, 6, 7, 6, -3]\n", "answer": "7"}
|
| 125 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, 2, -10, 0, -11, -6, 10, -11, -6, -3]\n", "answer": "3"}
|
| 126 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-7, 11, -10, -11, -1, -11, -6, -9, 11, 7]\n", "answer": "3"}
|
| 127 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, 5, -7, 1, 5, 0, -2, 1, -5, 9]\n", "answer": "4"}
|
| 128 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, 1, 7, -5, 1, -2, -2, 6, -1, -3]\n", "answer": "3"}
|
| 129 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, 3, 0, -5, 7, -3, -10, 6, -2, -1]\n", "answer": "4"}
|
| 130 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 9, -8, -10, -3, -9, 9, 11, -7, -5]\n", "answer": "4"}
|
| 131 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -6, -11, -9, 1, 1, 8, 3, 11, 6]\n", "answer": "5"}
|
| 132 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, 3, -9, -7, -7, -1, 3, 6, 6, -4]\n", "answer": "5"}
|
| 133 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-10, -2, -8, -8, 5, 2, 5, -5, -6, 4]\n", "answer": "4"}
|
| 134 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, -10, -3, 5, 0, -9, 11, -10, 10, 8]\n", "answer": "4"}
|
| 135 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, -7, 8, -5, 0, 9, -10, 10, -3, -5]\n", "answer": "5"}
|
| 136 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -5, -10, 10, 7, -10, 10, -8, 1, -3]\n", "answer": "4"}
|
| 137 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [5, 5, 11, -4, 6, 1, -5, -1, 4, 6]\n", "answer": "4"}
|
| 138 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, 7, 8, -5, -5, 9, -8, 3, -3, 3]\n", "answer": "4"}
|
| 139 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, -3, -7, 8, 8, 6, -10, -9, 2, -10]\n", "answer": "3"}
|
| 140 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-4, -6, -4, -10, -2, -9, -5, -11, -3, 11]\n", "answer": "5"}
|
| 141 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -7, -11, 1, 7, -9, -9, 3, -11, -2]\n", "answer": "3"}
|
| 142 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, -3, -10, -1, -11, 11, 8, -5, 0, -8]\n", "answer": "3"}
|
| 143 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, 10, 1, 4, 3, -9, 5, 6, -4, 6]\n", "answer": "4"}
|
| 144 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, -5, 1, 0, -10, -6, -1, 6, -8, 10]\n", "answer": "5"}
|
| 145 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -3, -2, 6, 10, 5, -5, 7, -3, 10]\n", "answer": "5"}
|
| 146 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -11, -2, -7, -7, -7, 9, 5, -4, -2]\n", "answer": "4"}
|
| 147 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, 8, 5, 3, -4, -2, 7, 10, -6, 9]\n", "answer": "4"}
|
| 148 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [10, -1, -7, 5, 9, 2, -7, -7, 7, 6]\n", "answer": "3"}
|
| 149 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, 2, 1, -5, 6, 5, -8, 6, 9, -8]\n", "answer": "4"}
|
| 150 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 5, -8, 1, -11, -8, -7, 11, 10, -6]\n", "answer": "4"}
|
| 151 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [0, -3, -9, -3, -3, -1, 0, 1, -1, 7]\n", "answer": "6"}
|
| 152 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [3, 9, 4, -1, -7, 9, 4, -3, 8, -5]\n", "answer": "3"}
|
| 153 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-7, 0, 3, -10, 5, 2, 6, 7, 3, -4]\n", "answer": "6"}
|
| 154 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 2, -11, -4, 6, 2, 0, -1, 7, 2]\n", "answer": "4"}
|
| 155 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-3, -3, 11, -3, 8, 7, -6, -7, 7, -1]\n", "answer": "2"}
|
| 156 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, 9, -10, 6, -6, 5, 0, -11, -3, -5]\n", "answer": "3"}
|
| 157 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-5, -5, -7, -4, 1, -9, 7, -4, 2, 5]\n", "answer": "5"}
|
| 158 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, 4, -6, -3, 6, 10, -4, 4, -11, -2]\n", "answer": "4"}
|
| 159 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, 6, 3, 2, 3, 4, -6, -9, -1, -7]\n", "answer": "4"}
|
| 160 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, 1, 2, -10, 4, 4, 7, -1, 2, 3]\n", "answer": "4"}
|
| 161 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, -1, 2, -3, -5, 6, -9, 11, -1, -3]\n", "answer": "4"}
|
| 162 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-2, -8, 11, -6, 6, 4, 2, 4, -8, 1]\n", "answer": "4"}
|
| 163 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -5, -7, -7, -6, -9, -3, 2, 4, 1]\n", "answer": "5"}
|
| 164 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, 6, 10, 1, -10, 4, 3, 2, -8, -2]\n", "answer": "4"}
|
| 165 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, -1, 4, -10, -5, 1, 7, 10, -1, 0]\n", "answer": "5"}
|
| 166 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, -2, 1, -5, -9, 8, 7, 2, -7, 6]\n", "answer": "5"}
|
| 167 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [7, 3, -4, -10, -3, 0, 6, 0, 7, -6]\n", "answer": "5"}
|
| 168 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [9, -5, -1, 5, -2, 7, -8, -6, 1, 4]\n", "answer": "4"}
|
| 169 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, 10, 6, -1, 5, 3, -3, -8, -6, 9]\n", "answer": "4"}
|
| 170 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, -11, -6, -1, 6, -10, 5, 1, 8, 0]\n", "answer": "5"}
|
| 171 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, 3, 11, -2, -2, -11, 0, -1, -1, -11]\n", "answer": "3"}
|
| 172 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [10, 5, -8, -3, -2, -10, -8, 5, 0, -8]\n", "answer": "4"}
|
| 173 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, 8, 7, 11, -4, 0, -8, 2, 11, -11]\n", "answer": "4"}
|
| 174 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 9, -4, -9, -7, 9, -2, 3, 0, 4]\n", "answer": "5"}
|
| 175 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 10, 9, 2, 9, 2, 5, 2, -11, -10]\n", "answer": "2"}
|
| 176 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, -6, -3, 5, 10, 3, 1, 4, -8, 3]\n", "answer": "5"}
|
| 177 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-3, 11, 5, 6, -3, -5, 9, 4, 11, 4]\n", "answer": "5"}
|
| 178 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 3, -11, -7, 3, 11, -2, -8, -7, -8]\n", "answer": "4"}
|
| 179 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, -8, 2, 5, 8, 11, 11, 5, -4, 10]\n", "answer": "5"}
|
| 180 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, -11, -1, 2, -5, 9, -5, 8, 1, -4]\n", "answer": "4"}
|
| 181 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 8, 0, -10, -11, 5, -11, 2, -6, 9]\n", "answer": "3"}
|
| 182 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [1, -10, 5, -2, -7, 5, -11, -7, 5, -6]\n", "answer": "3"}
|
| 183 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [8, 2, 10, 6, 9, 4, 8, 8, -3, 4]\n", "answer": "3"}
|
| 184 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, 11, 9, 8, -2, 10, -3, 10, -7, -10]\n", "answer": "3"}
|
| 185 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, 9, 1, 9, -3, 4, -9, -1, 0, 3]\n", "answer": "5"}
|
| 186 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-9, 7, -6, -7, 5, -9, 4, 0, 2, -7]\n", "answer": "4"}
|
| 187 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [4, -8, 0, 4, -1, -10, -4, -8, -4, -7]\n", "answer": "3"}
|
| 188 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, -10, 4, -2, 5, -8, -2, 6, 3, 5]\n", "answer": "5"}
|
| 189 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-8, -3, -9, -8, -5, 0, 4, 7, 4, -10]\n", "answer": "6"}
|
| 190 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-3, 9, 0, 4, 1, 6, 3, 2, -1, 8]\n", "answer": "5"}
|
| 191 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-11, -10, -6, 0, -2, -6, -3, 11, 8, 2]\n", "answer": "5"}
|
| 192 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, -11, -11, -9, -5, 8, 6, -1, 9, 3]\n", "answer": "5"}
|
| 193 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [11, -11, 2, 2, -1, -4, 1, -4, -9, -7]\n", "answer": "3"}
|
| 194 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-3, 7, 9, -6, 5, -8, -9, 5, 9, 1]\n", "answer": "3"}
|
| 195 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, 4, 4, 3, -2, 2, 5, 10, -5, 10]\n", "answer": "4"}
|
| 196 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-6, 10, 11, 7, 11, -10, 4, 8, 5, -8]\n", "answer": "3"}
|
| 197 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [6, -5, 10, 5, -7, 1, -2, 11, 4, 6]\n", "answer": "4"}
|
| 198 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-1, -7, 6, -9, -7, -3, 11, -1, 4, 7]\n", "answer": "6"}
|
| 199 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [-7, -5, 9, 7, 10, 11, 4, 7, -5, 4]\n", "answer": "5"}
|
| 200 |
+
{"prompt": "You are given a sequence of integers.\n\nTask: compute the length of the Longest Increasing Subsequence (LIS).\n\nDefinitions:\n- A subsequence is obtained by deleting zero or more elements without changing the order of remaining elements.\n- An increasing subsequence is STRICTLY increasing: each next element is > the previous one.\n\nOutput requirements:\n- Return ONLY the LIS length as an integer.\n\nSequence: [2, -9, 11, 7, 1, 4, 11, 9, -6, -8]\n", "answer": "4"}
|