Problem B. Art for Rest
Dashboard - 2023 CCPC Henan Provincial Collegiate Programming Contest - Codeforces
思路:我们可以暴力枚举每一个区间长度,然后只需要判断这个区间长度满不满足题意,不妨设现在枚举到mid,则我们那么整个区间会被分为多段,mid,mid,mid,mid,每段长度为mid,仅有最后一段可能小于mid,那么我们根据题意只需要判断相邻的段是否前一段的最大值小于后一段的最小值,如果不满足,则整个区间划分方式不对,当枚举所欲区间之后得到答案,而最大值最小值可以用st表处理,但是这种做法有点卡常,而且需要加一个判断,如果一开始为有序的,那么k取任何值都可以,则直接输出n,其他需要判断。
另一种快速的判断是,因为整个区间被分为多段,那么第一段的开头是1,第二段是1+mid,1+2*mid,所以第i段的开头是1+(i-1)*mid,所以对于每一段的开头,我们只需要判断前面的最大值,是不是比后面的最小值小,如果小,那么排序完序之后,当前这一段的前一段的最大值一定比当前这一段的最小值小,所以这样判断就可以省去区间判断,直接用一个前缀max,min进行判断,时间复杂度小
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector>
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=1e6+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}
int T,hackT;
int n,m,k;
int w[N];
int f1[N][21],f2[N][21];
int st[N];
void init(){
for(int j=0;j<21;j++) {
for(int i=1;i+(1<<j)-1<=n;i++) {
if(!j) f1[i][j]=w[i];
else f1[i][j]=min(f1[i][j-1],f1[i+(1<<j-1)][j-1]);
}
for(int i=1;i+(1<<j)-1<=n;i++) {
if(!j) f2[i][j]=w[i];
else f2[i][j]=max(f2[i][j-1],f2[i+(1<<j-1)][j-1]);
}
}
st[1]=0;
int res=0,last=1;
for(int i=2;i<=n;i++) {
if(last*2<=i) last=last*2,res++;
st[i]=res;
}
}
int query1(int l,int r) {
int len=r-l+1;
int k=st[len];
return min(f1[l][k],f1[r-(1<<k)+1][k]);
}
int query2(int l,int r) {
int len=r-l+1;
int k=st[len];
return max(f2[l][k],f2[r-(1<<k)+1][k]);
}
bool check(int mid) {
for(int i=1;;i+=mid) {
int l1=i,r1=i+mid-1;
int l2=i+mid,r2=min(n,i+mid+mid-1);
if(l2>n) break;
int l=query2(l1,r1),r=query1(l2,r2);
if(l>r) return false;
}
return true;
}
void solve() {
n=read();
for(int i=1;i<=n;i++) w[i]=read();
bool flag=true;
for(int i=2;i<=n;i++) {
if(w[i]-w[i-1]<0) flag=false;
}
if(flag) {
printf("%d\n",n);
return ;
}
init();
int res=0;
for(int i=1;i<=n;i++) if(check(i)) res++;
printf("%d\n",res);
}
int main() {
// init();
// stin();
// scanf("%d",&T);
T=1;
while(T--) hackT++,solve();
return 0;
}
#include<iostream>
#include<cstring>
#include<string>
#include<sstream>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<map>
#include<stack>
#include<vector>
#include<set>
#include<unordered_map>
#include<ctime>
#include<cstdlib>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
typedef pair<int,pair<int,int> > PIII;
const double eps=1e-7;
const int N=1e6+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}
int T,hackT;
int n,m,k;
int w[N];
int minn[N],maxn[N];
void solve() {
n=read();
for(int i=1;i<=n;i++) w[i]=read();
int last=0;
for(int i=1;i<=n;i++) maxn[i]=last,last=max(last,w[i]);
last=INF;
for(int i=n;i>=1;i--) last=min(last,w[i]),minn[i]=last;
int res=0;
for(int i=1;i<=n;i++) {
bool flag=true;
for(int j=1+i;j<=n;j+=i) {
if(maxn[j]>minn[j]) flag=false;
}
if(flag) res++;
}
printf("%d\n",res);
}
int main() {
// init();
// stin();
// scanf("%d",&T);
T=1;
while(T--) hackT++,solve();
return 0;
}