一个简陋的nlogn最大最小元
(这**不是O(n)就能解决的事吗!!!)
代码:
#include <bits/stdc++.h>
using namespace std;
#define ls l,mid
#define rs mid+1,r
#define mi (l+r)/2
const int MAXN=1e6+7;
int a[MAXN];
int maxn(int l,int r){
if(l==r) return a[l];
int mid=mi;
return max(maxn(ls),maxn(rs));
}
int minn(int l,int r){
if(l==r) return a[l];
int mid=mi;
return min(minn(ls),minn(rs));
}
int main()
{
int n;
while(scanf("%d",&n)!=-1){
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
printf("max: %d\n",maxn(1,n));printf("min: %d\n",minn(1,n));
}
}
/*
10
1541 1511 74877 5 0 41584 3581 2 6 6541111
10
1 2 3 4 5 6 7 8 9 10
*/