官方题解:https://ac.nowcoder.com/discuss/208642?type=101&order=0&pos=9&page=1
A : Equivalent Prefixes
题目链接 : https://ac.nowcoder.com/acm/contest/881/A
题解:
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <stdlib.h>
#include <math.h>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define INF 0x3f3f3f3f
#define maxn 100005
#define MAXN 1000010
#define N 100050
using namespace std;
const ull inf = 1LL << 61;
const long long mod=1e9+7;//注意两数相减加一个mod
const double PI=acos(-1);
const double eps=1e-5;
double gcd(double a,double b)
{
return (!b)?a:gcd(b,(long long)a%(long long)b);
}
double lcm(double a,double b)
{
return a/gcd(a,b)*b;
}
int dp1[maxn][20];
int dp2[maxn][20];
int arr1[maxn];
int arr2[maxn];
bool check(int l,int r)
{
if(l>r) return 1;
int k=log2(r-l+1);
int r1=arr1[dp1[l][k]]<arr1[dp1[r-(1<<k)+1][k]]?dp1[l][k]:dp1[r-(1<<k)+1][k];
int r2=arr2[dp2[l][k]]<arr2[dp2[r-(1<<k)+1][k]]?dp2[l][k]:dp2[r-(1<<k)+1][k];
if(r1!=r2) return 0;
return check(l,r1-1)&&check(r1+1,r);
}
int main()
{
//freopen("d:in.txt","r",stdin);
//freopen("d:out.txt","w",stdout);
priority_queue <int,vector<int>,less<int> > p1,p2;
priority_queue <int,vector<int>,greater<int> > q;
int n;
while(~scanf("%d",&n))
{
for(int i=1;i<=n;i++) scanf("%d",&arr1[i]);
for(int i=1;i<=n;i++) scanf("%d",&arr2[i]);
for(int i=1;i<=n;i++) {dp1[i][0]=i;dp2[i][0]=i;}
for(int j=1;(1<<j)<=n;j++)
for(int i=1;i+(1<<j)-1<=n;i++)
{
int u,v;
u=dp1[i][j-1];v=dp1[i+(1<<(j-1))][j-1];
dp1[i][j]=arr1[u]<arr1[v]?u:v;
u=dp2[i][j-1];v=dp2[i+(1<<(j-1))][j-1];
dp2[i][j]=arr2[u]<arr2[v]?u:v;
}
int l=1,r=n+1;
while(l<r-1)
{
int mid=(l+r)/2;
if(check(1,mid)) l=mid;
else r=mid;
}
cout<<l<<endl;
}
return 0;
}
B Integration
题目链接:https://ac.nowcoder.com/acm/contest/881/B
题目描述:
题解:
思路: https://blog.csdn.net/qq_41730082/article/details/96443875
c++代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<math.h>
#include<time.h>
#include<vector>
#include<set>
#include<map>
#include <assert.h>
#include<stack>
#define LL long long
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
LL mod=1e9+7;
const double PI=acos(-1.0);
const double eps=1e-10;
void quickread(){std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);}
int