全RE

P4715 【深基16.例1】淘汰赛

@[LX_zxy](/user/569061) 谢谢dalao,已AC
by __yiLIUyi__ @ 2024-07-26 17:30:42


@[__yiLIUyi__](/user/1143775) 不用谢
by LX_zxy @ 2024-07-26 17:36:19


```cpp #include<bits/stdc++.h> using namespace std; int n,a[10001],max1=-1,max2=-1,map1,map2; int main(){ cin>>n; n=pow(2,n); for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n/2;i++){ if(a[i]>max1){ max1=a[i]; map1=i; } } for(int i=n/2+1;i<=n;i++){ if(a[i]>max2){ max2=a[i]; map2=i; } } if(max1<max2){ cout<<map1; } else{ cout<<map2; } } ```
by BSJT_303 @ 2024-08-06 17:27:12


上一页 |