Datasets:
Upload dev file dev_medium_d5_n128_seed4002.jsonl
Browse files
dev/dev_medium_d5_n128_seed4002.jsonl
ADDED
|
@@ -0,0 +1,128 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 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: [0, 4, -16, 18, 4, 7, -9, 10, 5, 13, 16, 16, -19, 11, -9, -13]\n", "answer": "6"}
|
| 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: [17, -15, 20, 1, -2, -9, -17, 16, 15, -18, 12, -11, -9, 17, -17, -15]\n", "answer": "4"}
|
| 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: [-16, -10, 12, 14, -19, -5, 14, -4, 12, -5, 4, -13, -18, 18, 14, 14]\n", "answer": "6"}
|
| 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: [6, 6, -9, 15, -13, 7, 9, 15, -3, -6, -19, 18, 6, 16, 9, -4]\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: [20, -20, -8, -17, -12, 16, 8, 2, -8, 16, 4, -13, -1, -10, -4, 7]\n", "answer": "6"}
|
| 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: [10, 14, -2, 15, 3, -19, -20, -10, -2, 10, 5, 10, 15, 15, -1, -16]\n", "answer": "6"}
|
| 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: [10, -4, 12, -6, 1, -11, -9, 12, -14, 20, 11, -8, 15, -6, -11, 20]\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: [-1, -4, 13, -19, 16, 14, -9, 12, -3, 16, -7, 3, -15, -20, -4, -18]\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: [-6, 16, -9, 3, 10, -14, 5, 19, -13, 3, 1, 0, 16, -12, -2, 15]\n", "answer": "5"}
|
| 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: [-19, -17, 3, -12, -10, 8, -18, 0, 8, 20, 3, -20, 2, 6, -6, -1]\n", "answer": "7"}
|
| 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: [-10, -10, 12, -5, -9, -16, 19, 17, -16, -18, -10, 20, -5, 18, -7, 18]\n", "answer": "4"}
|
| 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: [14, -16, -11, 17, -14, -1, 10, -14, 20, -3, 13, 4, 5, -4, -5, -10]\n", "answer": "5"}
|
| 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: [4, 17, -12, -6, -7, -13, -11, 14, -13, 5, 20, 11, -5, 6, -18, 6]\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: [-19, -19, 12, 1, 1, 1, 0, -18, -15, 10, 19, -7, 5, -16, 8, -1]\n", "answer": "6"}
|
| 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: [-10, 18, 12, -8, 0, -16, -11, 20, 8, -11, -2, -19, -8, -1, 14, 11]\n", "answer": "5"}
|
| 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: [-11, 11, 9, 17, 15, 18, 12, -16, -17, -3, -9, -10, -18, 5, -10, 6]\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: [16, -3, 3, 20, 6, 5, 19, 5, -1, 1, 15, -20, -9, 6, -7, 8]\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: [8, -14, -10, 2, -10, 4, -1, 14, 17, -4, 12, 6, 2, -14, 17, 14]\n", "answer": "6"}
|
| 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: [-9, 15, 14, 5, -1, 4, 6, -15, -10, -12, -5, 12, 11, -8, -3, -5]\n", "answer": "5"}
|
| 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: [7, -14, 12, 7, -1, 12, 9, 11, 6, -20, 1, 9, -6, 3, 3, 11]\n", "answer": "5"}
|
| 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: [-13, 15, 12, 5, 9, 1, 16, 11, -2, 8, -3, 1, 15, -11, -9, 17]\n", "answer": "6"}
|
| 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: [-2, -2, 5, 18, -6, 13, 15, 16, 3, 8, -15, -1, -19, -18, 0, -17]\n", "answer": "5"}
|
| 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: [3, -11, 13, 7, 10, -4, 12, 11, -10, -6, 13, 10, 3, -15, -11, -3]\n", "answer": "5"}
|
| 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: [-11, -13, -5, 18, -6, -9, 17, 12, 17, 16, -20, -8, 11, 13, -13, 9]\n", "answer": "5"}
|
| 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: [-8, 11, 15, -3, 7, -14, 20, -9, 7, -4, 7, -17, -12, -16, -2, 1]\n", "answer": "5"}
|
| 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: [14, -8, 20, 19, 9, 9, -12, 20, -2, 19, -6, -14, 3, -3, 10, 5]\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: [-3, -5, -7, 10, 14, -17, -17, -18, 19, -9, 2, 16, 3, 16, 8, 11]\n", "answer": "6"}
|
| 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: [18, -4, 5, 5, -12, 7, 12, 3, 5, 2, 16, 3, -13, -11, -2, -6]\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: [3, -12, -3, -20, -16, 4, -10, 6, 0, -6, -7, -2, 13, 8, -16, 20]\n", "answer": "7"}
|
| 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: [18, 2, -13, -8, 8, 17, -16, 8, 17, -14, 15, -6, -18, -2, 13, 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: [-1, 0, 16, 2, 12, -10, -12, -15, 13, -2, 8, 19, 18, 7, -2, -3]\n", "answer": "6"}
|
| 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: [17, 10, 15, -5, -18, 13, -6, -2, 11, -20, 7, 14, -1, -10, 2, -5]\n", "answer": "5"}
|
| 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: [-18, 5, -15, -8, 19, 16, 9, -2, -19, -10, 7, -11, -20, -9, 7, 10]\n", "answer": "6"}
|
| 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: [20, 13, 13, 15, -18, -1, 15, -4, -4, -1, -13, -7, -17, 9, 7, -12]\n", "answer": "4"}
|
| 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: [13, 19, -8, 4, 19, 5, -20, -12, 18, 0, -10, 7, 12, -13, -11, -15]\n", "answer": "5"}
|
| 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: [-2, 20, 12, -18, -13, 18, 15, 14, 0, 10, 15, -4, 13, 2, -17, -6]\n", "answer": "5"}
|
| 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: [-14, 18, -18, 7, -4, 11, 19, -19, -20, -9, -11, -8, 15, -1, 16, -15]\n", "answer": "5"}
|
| 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: [18, -5, -12, 9, -19, 1, 8, 14, 16, 5, -6, 13, 3, -11, 18, -2]\n", "answer": "6"}
|
| 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: [-2, -2, 20, 4, 0, 3, -18, -13, 1, 13, 4, 9, 11, -11, 9, 20]\n", "answer": "7"}
|
| 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: [5, 0, 3, 19, -12, -16, 19, -4, -2, 8, 11, -14, -17, 8, 2, -19]\n", "answer": "5"}
|
| 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: [-11, -17, -15, -19, 15, 19, -13, 17, -12, -5, 4, 16, 0, -5, 4, 10]\n", "answer": "8"}
|
| 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: [4, 5, 9, -16, 11, -15, -3, -11, -4, 2, 9, 18, 18, -8, -16, -15]\n", "answer": "7"}
|
| 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: [-18, -15, 1, -18, 8, -3, 6, -2, -18, 15, -1, -18, -13, 9, -10, -7]\n", "answer": "6"}
|
| 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: [10, -17, -7, 16, -6, 7, -6, 11, -10, -10, 10, -8, 7, 20, -2, -20]\n", "answer": "6"}
|
| 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: [-7, -3, 8, 4, 2, -6, -8, 3, -11, 14, 6, 19, -10, -4, 1, 5]\n", "answer": "6"}
|
| 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: [-5, -13, -16, 14, -17, -14, 15, 4, -18, -12, 10, -3, 1, -16, 12, -7]\n", "answer": "6"}
|
| 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: [19, 0, 11, 13, -2, 3, 19, 13, 15, -15, -9, -9, -20, -15, -13, 3]\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: [3, 14, -17, 17, 3, 0, -10, 14, -18, -1, 13, 4, 19, 2, -7, 4]\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: [10, 12, 10, -6, 0, 11, 4, -2, 1, 1, 5, -1, -8, -8, 5, 19]\n", "answer": "5"}
|
| 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: [-17, -20, 16, 4, -8, -4, 5, -4, 2, 4, -12, -12, 15, -17, 1, 2]\n", "answer": "6"}
|
| 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: [-1, 20, -20, 13, 20, 20, 1, 5, -10, 1, 11, -20, 4, 8, 4, 1]\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: [-14, -15, 7, 6, -10, 13, -18, 7, 9, -18, 8, 0, 2, -16, 17, -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: [-3, 15, -13, -16, -19, 2, 3, -16, 14, 9, 15, 5, 3, 9, -20, -11]\n", "answer": "5"}
|
| 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, 5, 5, -14, -20, -5, -2, 11, -16, -19, 1, -5, 8, 9, -18, 13]\n", "answer": "7"}
|
| 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: [-17, -19, 12, -20, 17, -7, -6, 17, 9, 20, -11, -3, -19, -2, -11, 4]\n", "answer": "6"}
|
| 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: [-13, 11, 6, 6, 5, 3, -1, 19, -5, -5, -4, -14, -7, 16, -7, 7]\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: [-17, -1, -13, -9, 14, 18, -12, -13, -19, 4, 1, 17, -19, 4, 13, -7]\n", "answer": "6"}
|
| 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: [20, -2, -1, 9, 17, -7, 6, -7, -12, 11, -10, 9, 19, -2, -9, 4]\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: [4, 11, -12, -15, -3, 0, -18, 15, 17, 14, -17, 13, 0, 10, -19, -16]\n", "answer": "5"}
|
| 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: [1, -20, 9, -7, 14, 16, -2, 7, -4, 10, -17, 13, 13, -6, 15, 3]\n", "answer": "7"}
|
| 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: [18, -12, 5, -14, -2, 2, -1, 15, -16, 15, -4, -8, -16, 12, 2, -9]\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: [20, 8, -15, -9, -7, 14, -4, -5, -4, 12, 1, 2, -20, -6, -8, 17]\n", "answer": "8"}
|
| 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, -2, 7, -5, 15, -3, 2, 14, 17, -8, 16, 5, 6, 18, 7, -11]\n", "answer": "7"}
|
| 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: [-1, -10, 19, 19, -15, -12, -9, 20, -3, -20, 19, -1, -5, -11, -14, -2]\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: [-5, -7, -11, 14, 12, -7, -2, -1, 1, 16, 9, 17, -5, 11, -14, -4]\n", "answer": "7"}
|
| 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: [-6, 15, 11, 16, 15, -18, 7, -13, -2, 5, 13, -3, 5, -13, 4, -9]\n", "answer": "5"}
|
| 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: [-17, 4, 5, 3, 14, -20, -19, 6, 3, -5, 14, 13, -6, 8, -10, 18]\n", "answer": "6"}
|
| 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: [14, 4, 9, -13, -5, -4, -6, -12, 20, -17, 6, -11, 10, -9, 5, 11]\n", "answer": "6"}
|
| 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: [-19, -13, 6, 17, 20, 7, -12, 15, 1, -16, -3, 6, 15, -2, 2, -7]\n", "answer": "6"}
|
| 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, -11, -16, 15, -15, -20, -12, 16, 0, 7, 9, -14, -15, 6, 0, 16]\n", "answer": "7"}
|
| 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: [5, 3, -13, -11, 5, 16, -8, 16, -7, -1, -2, 2, 9, -2, 9, 13]\n", "answer": "8"}
|
| 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: [-5, 12, -13, -13, -11, 19, -17, -16, -3, 15, -15, -15, -13, -2, -8, 13]\n", "answer": "6"}
|
| 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: [-7, -17, -3, -20, 15, 15, -19, -7, 8, -3, 6, 6, -18, -5, -13, -10]\n", "answer": "5"}
|
| 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: [12, -20, -5, -1, -10, -9, -13, -13, 2, -14, -11, 2, 11, -20, 18, 4]\n", "answer": "6"}
|
| 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: [-13, 5, -19, 3, 17, 8, 14, -1, 7, 16, -11, -7, -11, -17, -15, -6]\n", "answer": "5"}
|
| 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: [-20, -18, -19, -18, -14, 13, -17, 11, 19, -19, 16, 14, -11, -9, 18, -4]\n", "answer": "7"}
|
| 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: [-1, 12, -5, -18, 5, -12, 10, 20, 4, -20, 9, 2, -16, -12, -18, -12]\n", "answer": "4"}
|
| 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: [20, 3, 8, 16, 7, -16, 6, -19, -8, 15, -6, -13, 9, 18, 5, 4]\n", "answer": "5"}
|
| 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: [-20, -9, 18, 12, 1, 20, 10, -5, -12, -10, -19, 15, -18, 11, -8, -18]\n", "answer": "5"}
|
| 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: [14, -18, -18, -18, -1, 16, 1, -5, 0, 0, -15, 14, 20, 10, 12, -2]\n", "answer": "5"}
|
| 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: [-3, -8, -20, 12, -13, -1, -17, 17, 3, -2, 15, -3, -10, -15, -4, 6]\n", "answer": "5"}
|
| 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: [-3, 19, -3, 18, -12, -10, 0, -8, 4, -19, 14, -17, -17, -9, -10, 3]\n", "answer": "5"}
|
| 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: [-14, 14, 3, 12, -8, -19, -13, -9, 8, 10, 8, -8, 7, 7, 0, 0]\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: [9, -12, 5, -8, 13, -3, 1, -17, 3, -11, 8, -11, -12, -19, -7, -4]\n", "answer": "6"}
|
| 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: [20, 3, 20, -6, 0, -3, -2, 4, -3, -13, -19, -14, 2, -17, 4, 12]\n", "answer": "6"}
|
| 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: [4, 13, 8, -17, -20, 20, -4, -16, 6, -5, -8, 20, -3, 3, 15, 20]\n", "answer": "7"}
|
| 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: [-14, 7, 13, -15, 12, 17, 20, 16, -9, 9, -5, 11, 2, 15, -18, -1]\n", "answer": "5"}
|
| 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: [-2, 4, 8, 2, 18, 2, 7, -6, -3, -6, -7, 12, 17, -14, 2, -13]\n", "answer": "5"}
|
| 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: [7, 4, 9, 1, 14, -10, 9, 2, 3, 9, 18, -20, -7, 17, 9, -11]\n", "answer": "5"}
|
| 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: [19, -17, -1, 1, 10, -7, -11, 4, 9, 17, 13, -12, -17, -8, -8, 4]\n", "answer": "6"}
|
| 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: [17, 7, -13, -15, 8, 16, 20, 3, 0, 6, -4, 7, 17, -19, 5, 9]\n", "answer": "5"}
|
| 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: [3, 4, -1, 17, 12, 3, 17, 20, -20, 13, 14, 9, 17, 20, -8, -4]\n", "answer": "7"}
|
| 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: [17, 0, 4, -14, 11, 1, -5, -3, 12, -17, -2, 9, 17, 14, -13, 8]\n", "answer": "6"}
|
| 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: [-4, 9, 16, 17, 12, -3, 14, -15, -2, 2, 0, -7, -4, 11, 0, 1]\n", "answer": "5"}
|
| 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: [-18, 7, -19, -8, 13, -4, -6, -18, -2, -12, 0, -17, 20, -12, -4, -4]\n", "answer": "6"}
|
| 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: [-10, -13, 13, 1, -6, -10, 7, -8, 14, -10, -10, -15, 7, -3, -8, -3]\n", "answer": "4"}
|
| 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: [13, 3, 19, 16, 19, -19, 18, -11, -10, -3, -14, 19, -16, -14, -12, 5]\n", "answer": "5"}
|
| 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: [-19, 2, 12, 17, 17, 19, -12, 5, -13, -9, -17, 10, 17, 16, 20, 4]\n", "answer": "6"}
|
| 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: [-12, 14, -7, -1, 7, 14, -17, -7, -6, -6, -16, 17, 20, 1, -14, -17]\n", "answer": "7"}
|
| 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: [-1, -5, 2, -6, 20, -18, 19, -19, 13, 14, 9, -9, -20, 1, 7, -3]\n", "answer": "4"}
|
| 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: [11, -15, 18, -3, 18, -13, 15, 13, 3, -19, 16, -3, -8, 17, -10, -15]\n", "answer": "5"}
|
| 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: [5, 16, -11, 12, -14, 9, -11, 15, -9, -16, 16, -9, 1, -19, 13, 1]\n", "answer": "5"}
|
| 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: [-10, -20, -5, 17, -20, 3, -14, -6, -15, -4, 20, -3, 15, 3, 4, 7]\n", "answer": "8"}
|
| 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: [9, -4, 17, -10, -12, 17, -8, 15, -4, 7, -20, 5, 2, -3, -16, -1]\n", "answer": "5"}
|
| 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: [-16, 7, 17, 6, 9, -2, 7, 14, 20, 0, 8, -15, -3, -5, 5, 3]\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: [15, 1, 19, -5, 5, 15, 18, 8, 8, 12, 1, -4, 4, 4, -13, 10]\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: [1, 12, 5, -8, 12, 11, 7, -3, -10, 20, 6, -17, -9, -8, 15, 19]\n", "answer": "5"}
|
| 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: [2, -18, -15, -14, -20, -8, -1, 6, -19, -10, -7, -12, 12, 12, -18, -2]\n", "answer": "7"}
|
| 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: [-2, -1, 6, -7, -16, -20, -20, 9, -19, 9, 14, 13, -14, 11, -7, 6]\n", "answer": "5"}
|
| 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: [0, -8, 5, 6, 14, 7, 19, 7, 3, 7, 19, 18, 19, 12, 5, 11]\n", "answer": "6"}
|
| 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: [-3, -18, -4, 1, -3, 5, -1, -2, -19, -14, -8, 2, 3, -6, 18, 11]\n", "answer": "7"}
|
| 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: [-20, -15, 18, 5, -5, 3, 2, 7, 19, 7, 20, -7, -14, 8, 20, -19]\n", "answer": "7"}
|
| 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: [-16, -17, 19, 11, -17, 4, 14, -13, -12, 16, 0, -19, -18, 14, 18, 6]\n", "answer": "6"}
|
| 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, -12, -5, 6, 3, 7, -5, 5, -8, -11, -19, -6, 13, -20, 0]\n", "answer": "5"}
|
| 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: [-6, -14, 1, 6, 8, 4, -5, -3, -8, -15, -7, -14, 1, -14, 20, -5]\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: [-10, -14, -17, -8, -18, -16, -3, 8, 7, -7, 10, -20, 7, -5, 6, -11]\n", "answer": "5"}
|
| 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: [-14, -7, -18, -7, -1, 9, -20, 4, -15, -18, 5, -11, 15, -15, 1, -20]\n", "answer": "6"}
|
| 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: [10, 5, -20, -17, -14, 4, 5, -2, -1, -2, -19, 19, -18, 1, -4, -6]\n", "answer": "6"}
|
| 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: [-11, -16, 15, -20, 2, 3, -13, 0, -12, -8, 5, 18, -19, 7, 17, -8]\n", "answer": "7"}
|
| 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: [-7, 15, -13, 4, -13, 11, 2, 7, 20, -14, 14, -19, -13, 10, 13, 3]\n", "answer": "5"}
|
| 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: [-6, -18, -5, 16, -4, 9, 17, -6, 4, -6, 16, -14, -8, -4, 19, -20]\n", "answer": "6"}
|
| 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: [-3, 4, 5, -15, -17, 18, 0, 3, 16, -1, 10, -10, 16, -1, 3, -1]\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: [-20, -15, 4, 3, 13, 16, 7, 4, 1, -20, 16, 16, 10, -6, 10, 19]\n", "answer": "6"}
|
| 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: [19, -20, 10, 18, -13, 16, -20, -16, -8, 12, 7, 1, 13, 18, 19, 0]\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: [-10, -15, 19, 8, 16, 8, 12, -3, 7, 15, 10, -12, -13, 7, -2, 16]\n", "answer": "5"}
|
| 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: [-20, 11, 1, -12, 6, 19, -3, 9, -11, -20, -14, -17, 16, -4, 10, 3]\n", "answer": "5"}
|
| 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: [-12, -14, 20, -11, -17, 0, -7, 13, 10, 6, -12, 13, 10, 19, 5, -7]\n", "answer": "6"}
|
| 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: [10, -9, 14, 15, 2, 4, 20, 9, 4, -13, 20, 8, -8, -12, 8, 12]\n", "answer": "5"}
|