- 【2025-11-05 P1】区间
挑战最短代码
-
InnitTimmer LV 8 @ 2025-11-5 17:03:17
挑战最长一行不超过 个字符的最短代码
目前最短代码
#include<bits/stdc++.h>
#define N 300005
#define r(n) for(i=1;i<=(n);i++)
#define l (a[k[t]]>a[i]||a[i]%a[k[t]])
using namespace std;
int n,c,w,t,i,q,a[N],L[N],R[N],p[N],k[N];
int main(){cin>>n;r(n)cin>>a[i];
r(n){while(t&&l)R[k[t--]]=i;
k[++t]=i;}while(t)R[k[t--]]=n+1;
for(i=n;i>=1;i--){while(t&&l)L[k[t--]]=i;
k[++t]=i;}while(t)L[k[t--]]=0;
r(n){q=R[i]-L[i]-1;if(q>w)w=q,p[c=1]=L[i]+1;
else if(q==w&&p[c]!=L[i]+1)p[++c]=L[i]+1;}
cout<<c<<" "<<w<<"\n";
r(c)cout<<p[i]<<" ";}
6 条评论
-
zxq @ 2026-1-24 11:32:40
这是什么代码 H~2~O+CO~2~H~2~CO~3~ 这是什么代码 H2O+CO2H2CO3
-
@ 2026-1-24 11:32:12
这是什么代码 H~2~O+CO~2~==H~2~CO~3~
-
@ 2025-11-6 9:28:41
458
#include<iostream> #define N 300005 #define r(n) for(i=1;i<=(n);i++) #define l a[i]%a[k[t]] int n,c,w,t,i,q,a[N],L[N],R[N],p[N],k[N]; main(){std::cin>>n;r(n)std::cin>>a[i];r(n){ while(t&&l)R[k[t--]]=i;k[++t]=i;}while(t) R[k[t--]]=n+1;for(i=n;i>=1;i--){while(t&&l) L[k[t--]]=i;k[++t]=i;}while(t)L[k[t--]]=0; r(n){q=R[i]-L[i]-1;if(q>w)w=q,p[c=1]=L[i]+1; if(q==w&&p[c]!=L[i]+1)p[++c]=L[i]+1;} std::cout<<c<<" "<<w<<"\n"; r(c)std::cout<<p[i]<<" ";}fvv U.S President Trump and lzdll
-
@ 2025-11-6 9:24:57
463
#include<iostream> #define N 300005 #define r(n) for(i=1;i<=(n);i++) #define l a[i]%a[k[t]] using namespace std; int n,c,w,t,i,q,a[N],L[N],R[N],p[N],k[N]; main(){cin>>n;r(n)cin>>a[i];r(n){ while(t&&l)R[k[t--]]=i;k[++t]=i;}while(t) R[k[t--]]=n+1;for(i=n;i>=1;i--){while(t&&l) L[k[t--]]=i;k[++t]=i;}while(t)L[k[t--]]=0; r(n){q=R[i]-L[i]-1;if(q>w)w=q,p[c=1]=L[i]+1; else if(q==w&&p[c]!=L[i]+1)p[++c]=L[i]+1;} cout<<c<<" "<<w<<"\n";r(c)cout<<p[i]<<" ";}fvv U.S President Trump
-
@ 2025-11-6 9:11:32468
#include<bits/stdc++.h> #define N 300005 #define r(n) for(i=1;i<=(n);i++) #define l a[i]%a[k[t]] using namespace std; int n,c,w,t,i,q,a[N],L[N],R[N],p[N],k[N]; main(){cin>>n;r(n)cin>>a[i];r(n){ while(t&&l)R[k[t--]]=i;k[++t]=i;}while(t) R[k[t--]]=n+1;for(i=n;i>=1;i--){while(t&&l) L[k[t--]]=i;k[++t]=i;}while(t)L[k[t--]]=0; r(n){q=R[i]-L[i]-1;if(q>w)w=q,p[c=1]=L[i]+1; else if(q==w&&p[c]!=L[i]+1)p[++c]=L[i]+1;} cout<<c<<" "<<w<<"\n";r(c)cout<<p[i]<<" ";} -
@ 2025-11-6 9:02:48
#include<bits/stdc++.h> #define N 300005 #define r(n) for(i=1;i<=(n);i++) #define l a[i]%a[k[t]] using namespace std; int n,c,w,t,i,q,a[N],L[N],R[N],p[N],k[N]; int main(){cin>>n;r(n)cin>>a[i]; r(n){while(t&&l)R[k[t--]]=i; k[++t]=i;}while(t)R[k[t--]]=n+1; for(i=n;i>=1;i--){while(t&&l)L[k[t--]]=i; k[++t]=i;}while(t)L[k[t--]]=0; r(n){q=R[i]-L[i]-1;if(q>w)w=q,p[c=1]=L[i]+1; else if(q==w&&p[c]!=L[i]+1)p[++c]=L[i]+1;} cout<<c<<" "<<w<<"\n"; r(c)cout<<p[i]<<" ";}
- 1
