{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cdiv id\u003d\"problem-body\"\u003e \n \u003cp\u003e \u003c/p\u003e \n \u003ctable class\u003d\"problems\" style\u003d\"width: 100%;\" border\u003d\"0\"\u003e \n \u003c/table\u003e \n \u003cp\u003e\u003c/p\u003e \n \u003cp\u003eGiven a sequence of n numbers a\u003csub\u003e1\u003c/sub\u003e, a\u003csub\u003e2\u003c/sub\u003e, ..., a\u003csub\u003en\u003c/sub\u003e and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of distinct elements in the subsequence a\u003csub\u003ei\u003c/sub\u003e, a\u003csub\u003ei+1\u003c/sub\u003e, ..., a\u003csub\u003ej\u003c/sub\u003e.\u003c/p\u003e \n \u003ch3\u003eInput\u003c/h3\u003e \n \u003cul\u003e \n \u003cli\u003eLine 1: n (1 ≤ n ≤ 30000).\u003c/li\u003e \n \u003cli\u003eLine 2: n numbers a\u003csub\u003e1\u003c/sub\u003e, a\u003csub\u003e2\u003c/sub\u003e, ..., a\u003csub\u003en\u003c/sub\u003e (1 ≤ a\u003csub\u003ei\u003c/sub\u003e ≤ 10\u003csup\u003e6\u003c/sup\u003e).\u003c/li\u003e \n \u003cli\u003eLine 3: q (1 ≤ q ≤ 200000), the number of d-queries.\u003c/li\u003e \n \u003cli\u003eIn the next q lines, each line contains 2 numbers i, j representing a d-query (1 ≤ i ≤ j ≤ n).\u003c/li\u003e \n \u003c/ul\u003e \n \u003ch3\u003eOutput\u003c/h3\u003e \n \u003cul\u003e \n \u003cli\u003eFor each d-query (i, j), print the number of distinct elements in the subsequence a\u003csub\u003ei\u003c/sub\u003e, a\u003csub\u003ei+1\u003c/sub\u003e, ..., a\u003csub\u003ej\u003c/sub\u003e in a single line. \u003cp\u003e\u0026nbsp;\u003c/p\u003e \u003c/li\u003e \n \u003c/ul\u003e \n \u003ch3\u003eExample\u003c/h3\u003e \n \u003cpre\u003e\u003cstrong\u003eInput\u003c/strong\u003e\n5\n1 1 2 1 3\n3\n1 5\n2 4\n3 5\n\n\u003cstrong\u003eOutput\u003c/strong\u003e\n3\n2\n3 \n\u003c/pre\u003e \n \u003cp\u003e \u003c/p\u003e \n \u003c/div\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}}]}