题目链接:https://ac.nowcoder.com/acm/contest/881/A
题目大意
定义 RMQ(u, L, R) 为 u 数组在区间 [L, R] 上最小值的下标。
如果有 2 个数组 u,v,长度都为 m,且元素值互不相同,对于 [1, m] 的任意一个子区间 [L, R],都有 RMQ(u, L, R) = RMQ(v, L, R),那我们就说这两个数组是同构的。
现给定 2 个数组 a, b,求最大的 p,使得 a,b 在 [1, p] 上同构。
分析
假设 p 现在取到 i,这个时候遍历到 i + 1 项,如果 a[i + 1] 和 b[i + 1] 都是前 i + 1 项的第 k 小,那么 p 就可以加一,因为这时数组在以 i + 1 为右区间的所有区间上都满足条件(如果 [L, i + 1] 最小值的下标不是 i + 1,那么成立,因为前 i 项也是这么过来的,都满足条件;如果 [L, i + 1] 最小值的下标是 i + 1,根据前提,两数组最小值的下标就是 i + 1,也成立)。
一旦 i + 1 项不满足,那么 p 的最大就是 i,这个就不赘述了,找个例子或者自行理解。
代码如下
![](https://i-blog.csdnimg.cn/blog_migrate/8f900a89c6347c561fdf2122f13be562.gif)
![](https://i-blog.csdnimg.cn/blog_migrate/961ddebeb323a10fe0623af514929fc1.gif)
1 #include <bits/stdc++.h> 2 using namespace std; 3 4 #define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); 5 #define Rep(i,n) for (int i = 0; i < (n); ++i) 6 #define For(i,s,t) for (int i = (s); i <= (t); ++i) 7 #define rFor(i,t,s) for (int i = (t); i >= (s); --i) 8 #define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i) 9 #define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i) 10 #define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i) 11 #define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i) 12 13 #define pr(x) cout << #x << " = " << x << " " 14 #define prln(x) cout << #x << " = " << x << endl 15 16 #define LOWBIT(x) ((x)&(-x)) 17 18 #define ALL(x) x.begin(),x.end() 19 #define INS(x) inserter(x,x.begin()) 20 #define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end()) 21 #define REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // 删去 x 中所有 c 22 #define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower); 23 #define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper); 24 25 #define ms0(a) memset(a,0,sizeof(a)) 26 #define msI(a) memset(a,inf,sizeof(a)) 27 #define msM(a) memset(a,-1,sizeof(a)) 28 29 #define MP make_pair 30 #define PB push_back 31 #define ft first 32 #define sd second 33 34 template<typename T1, typename T2> 35 istream &operator>>(istream &in, pair<T1, T2> &p) { 36 in >> p.first >> p.second; 37 return in; 38 } 39 40 template<typename T> 41 istream &operator>>(istream &in, vector<T> &v) { 42 for (auto &x: v) 43 in >> x; 44 return in; 45 } 46 47 template<typename T> 48 ostream &operator<<(ostream &out, vector<T> &v) { 49 Rep(i, v.size()) out << v[i] << " \n"[i == v.size()]; 50 return out; 51 } 52 53 template<typename T1, typename T2> 54 ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) { 55 out << "[" << p.first << ", " << p.second << "]" << "\n"; 56 return out; 57 } 58 59 inline int gc(){ 60 static const int BUF = 1e7; 61 static char buf[BUF], *bg = buf + BUF, *ed = bg; 62 63 if(bg == ed) fread(bg = buf, 1, BUF, stdin); 64 return *bg++; 65 } 66 67 inline int ri(){ 68 int x = 0, f = 1, c = gc(); 69 for(; c<48||c>57; f = c=='-'?-1:f, c=gc()); 70 for(; c>47&&c<58; x = x*10 + c - 48, c=gc()); 71 return x*f; 72 } 73 74 template<class T> 75 inline string toString(T x) { 76 ostringstream sout; 77 sout << x; 78 return sout.str(); 79 } 80 81 inline int toInt(string s) { 82 int v; 83 istringstream sin(s); 84 sin >> v; 85 return v; 86 } 87 88 //min <= aim <= max 89 template<typename T> 90 inline bool BETWEEN(const T aim, const T min, const T max) { 91 return min <= aim && aim <= max; 92 } 93 94 typedef long long LL; 95 typedef unsigned long long uLL; 96 typedef pair< double, double > PDD; 97 typedef pair< int, int > PII; 98 typedef pair< int, PII > PIPII; 99 typedef pair< string, int > PSI; 100 typedef pair< int, PSI > PIPSI; 101 typedef set< int > SI; 102 typedef set< PII > SPII; 103 typedef vector< int > VI; 104 typedef vector< double > VD; 105 typedef vector< VI > VVI; 106 typedef vector< SI > VSI; 107 typedef vector< PII > VPII; 108 typedef map< int, int > MII; 109 typedef map< int, string > MIS; 110 typedef map< int, PII > MIPII; 111 typedef map< PII, int > MPIII; 112 typedef map< string, int > MSI; 113 typedef map< string, string > MSS; 114 typedef map< PII, string > MPIIS; 115 typedef map< PII, PII > MPIIPII; 116 typedef multimap< int, int > MMII; 117 typedef multimap< string, int > MMSI; 118 //typedef unordered_map< int, int > uMII; 119 typedef pair< LL, LL > PLL; 120 typedef vector< LL > VL; 121 typedef vector< VL > VVL; 122 typedef priority_queue< int > PQIMax; 123 typedef priority_queue< int, VI, greater< int > > PQIMin; 124 const double EPS = 1e-8; 125 const LL inf = 0x7fffffff; 126 const LL infLL = 0x7fffffffffffffffLL; 127 const LL mod = 1e9 + 7; 128 const int maxN = 1e5 + 7; 129 const LL ONE = 1; 130 const LL evenBits = 0xaaaaaaaaaaaaaaaa; 131 const LL oddBits = 0x5555555555555555; 132 133 int n, a[maxN], b[maxN], ans; 134 135 void solve(VPII &x, PII &y) { 136 while(!x.empty() && y.ft < x.back().ft) x.pop_back(); 137 x.PB(y); 138 } 139 140 int main(){ 141 //freopen("MyOutput.txt","w",stdout); 142 //freopen("input.txt","r",stdin); 143 //INIT(); 144 while(~scanf("%d", &n)) { 145 For(i, 1, n) scanf("%d", &a[i]); 146 For(i, 1, n) scanf("%d", &b[i]); 147 148 VPII sta, stb; 149 ans = n; 150 151 For(i, 1, n) { 152 PII x(a[i], i); 153 solve(sta, x); 154 155 x = PII(b[i], i); 156 solve(stb, x); 157 158 if(sta.size() != stb.size() || sta.back().sd != stb.back().sd) { 159 ans = i - 1; 160 break; 161 } 162 } 163 164 printf("%d\n", ans); 165 } 166 return 0; 167 }