http://acm.hdu.edu.cn/showproblem.php?pid=1280
分析:两数和的范围2~10000,用计数排序暴力枚举
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int NM=10000;
int a[3005],count[NM+5];
bool b[NM+5];
int main()
{
int i,j,n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(b,0,sizeof(b));
memset(count,0,sizeof(count));
for(i=0;i<n;i++)
scanf("%d",&a[i]);
for(i=0;i<n;i++)
for(j=i+1;j<n;j++)
{
b[a[i]+a[j]]=1;
count[a[i]+a[j]]++;
}
for(i=NM;i>0&&m;i--)
{
if(b[i])
{
for(j=0;j<count[i]&&m;j++)
{
m--;
printf("%d",i);
if(m>0) printf(" ");
}
}
}
printf("\n");
}
return 0;
}
http://acm.hdu.edu.cn/showproblem.php?pid=1425
分析:数+500000,范围0~1000000
http://acm.hdu.edu.cn/showproblem.php?pid=3785
分析:找不到范围了亲,但是可以用sort暴力排序(其实这三题都可以用sort暴力,当然用hash数组比较快撒~)
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int NM=100005;
int a[NM];
bool comp(int A,int B)
{
if(A>B) return 1;
else return 0;
}
int main()
{
int i,n,m;
while(scanf("%d%d",&n,&m)&&(n||m))
{
for(i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n,comp);
if(n<=m)
{
printf("%d",a[0]);
for(i=1;i<n;i++)
printf(" %d",a[i]);
}
else
{
printf("%d",a[0]);
for(i=1;i<m;i++)
printf(" %d",a[i]);
}
printf("\n");
}
return 0;
}