#include <iostream>  #include <vector>  #include <algorithm>  using namespace std;  bool is_had(vector<int> v, size_t i, size_t j) {     for (size_t m = i; m < j; ++m) {        if (v[m] == v[j])         return true;      }      return false;  }  int dp[2000][2000] = { 0 };  int main()   {      int n = 0;      int m = 0;      cin >> n >> m;      vector<int> v;      int tmp = 0;      for (size_t i = 0; i < n; ++i) {          cin >> tmp;          v.push_back(tmp);      }      size_t q = 0;      cin >> q;      vector<vector<int> >res;      int tmp2;      for (size_t i = 0; i < q; ++i) {          vector<int> t;          cin >> tmp >> tmp2;          t.push_back(tmp);          t.push_back(tmp2);          res.push_back(t);      }      for (size_t i = 0; i < n; ++i)          dp[i][i] = 1;      for (size_t i = 0; i < n; ++i) {          for (size_t j = i + 1; j < n; ++j) {              if (is_had(v, i, j))                  dp[i][j] = dp[i][j - 1];              else                  dp[i][j] = dp[i][j - 1] + 1;          }      }      for (size_t i = 0; i < q; ++i) {          cout << dp[res[i][0] - 1][res[i][1] - 1] << endl;      }      return 0;  } 有什么问题啊。。。。求告知