公开20190801博客,汗
参考:https://www.cnblogs.com/multhree/p/10342553.html
cf1198A
代码wa on test 2
#include<bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int a[maxn],b[maxn];
int main()
{
int n,I;
cin>>n>>I;
for(int i =1;i<=n;i++)
scanf("%d",&a[i]);
if(30*n <= I*8)
{
puts("0");
return 0;
}
int dert = 1<<(I*8/n);
sort(a+1,a+n+1);
int ans = 0;
a[0] = -1;
for(int i = 1;i<=n;i++)
b[i] = a[i];
int len = unique(&b[1],&b[n+1]) - &b[0];
for(int i = 1;i<=n;i++)
{
a[i] = lower_bound(&b[1],&b[len+1],a[i]) - &b[0];
}
for(int i = 1;i<=n;i++)
{
if(a[i] == a[i-1])
continue;
int r = upper_bound(&a[1],&a[n+1],a[i]+dert-1) - &a[0];
ans = max(ans,r-i);
}
cout<<max(0,n - ans)<<endl;
}
由于unique返回的是.end()的地址,也就是这里b[1]~b[len-1]才是去重后得到的数组
改正如下,AC代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int a[maxn],b[maxn];
int main()
{
int n,I;
cin>>n>>I;
for(int i =1;i<=n;i++)
scanf("%d",&a[i]);
if(30*n <= I*8)
{
puts("0");
return 0;
}
int dert = 1<<(I*8/n);
sort(a+1,a+n+1);
int ans = 0;
a[0] = -1;
for(int i = 1;i<=n;i++)
b[i] = a[i];
int len = unique(&b[1],&b[n+1]) - &b[0];
for(int i = 1;i<=n;i++)
{
a[i] = lower_bound(&b[1],&b[len],a[i]) - &b[0];
}
for(int i = 1;i<=n;i++)
{
if(a[i] == a[i-1])
continue;
int r = upper_bound(&a[1],&a[n+1],a[i]+dert-1) - &a[0];
ans = max(ans,r-i);
}
cout<<max(0,n - ans)<<endl;
}
去掉了一个小小的+1就过了: