[题解]ACMer 2013 Daily Training- 1st Mar for 11x&&12x

A - An antiarithmetic permutation

题解:分治法

用分治法将序列中处于奇,偶位置的数字分组，分出来的是等差2的序列，再在奇偶数组中进行分组，最终就可得到一个满足条件的数列

ex:[0,1,2,3,4,5,6]  

分组后:[0,2,4] [1,3,5] 这2组之间的数是不会构成等差数列的,因为每一组内的差别是偶数，而跨组数间的差是奇数。如0,2,5不能构成等差数列

源代码 :

# include<cstdio>
# include<cstring>
using namespace std;

const int maxn=10005;
int a[maxn],tmp[maxn];

void divide(int l,int r)
{
	int i,j,m;
	if(r-l<=1)
		return;
	m=(l+r)>>1;
	for(i=l;i<=r;i++)
		tmp[i]=a[i];
	for(i=j=l;i<=r;i+=2,j++)
		a[j]=tmp[i];
	for(i=l+1;i<=r;i+=2,j++)
		a[j]=tmp[i];
	divide(l,m);
	divide(m+1,r);
}

int main()
{
	int i,n;
	while(scanf("%d",&n)!=EOF&&n)
	{
		for(i=1;i<=n;i++)
			a[i]=i-1;
		divide(1,n);
		printf("%d: %d",n,a[1]);
		for(i=2;i<=n;i++)
			printf(" %d",a[i]);
		printf("\n");
	}
	return 0;
}

B - Automatic Poetry

题解:模拟题

读入2个字符串，第一个字符串(s1<s2>s3<s4>s5)去掉括号后输出输出 (s1s2s3s4s5)

第二个字符串中的"..."换成s4s3s2s5输出即可

源代码：

# include<cstdio>
# include<cstring>
using namespace std;

const int maxn=105;
char s[10][maxn];
char in[maxn];

int main()
{
	int i,t,j,k,num,len;
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		gets(in);
		len=strlen(in),num=1,k=0;
		for(i=0;i<len;i++)
		{
			if(in[i]=='<'||in[i]=='>')
			{
				s[num++][k]='\0';
				k=0;
			}
			else
			{
				printf("%c",in[i]);
				s[num][k++]=in[i];
			}
		}
		s[num][k]='\0';
		printf("\n");
		gets(in);
		len=strlen(in);
		for(i=0;i<len;i++)
		{
			if(in[i]!='.')
				printf("%c",in[i]);
			else
			{
				printf("%s%s%s%s\n",s[4],s[3],s[2],s[5]);
				break;
			}
		}
	}
	return 0;
}

C - Train Swapping

题解:冒泡排序

模拟冒泡排序，输出交换的次数

注:这题因为数据小，所以直接模拟可过(O(n^2)),如果数据大可采用树状数组或者归并排序统计逆序对，可参考http://poj.org/problem?id=2299

源代码:

# include<cstdio>
# include<cstring>
using namespace std;

const int maxn=55;
int a[maxn];

int main()
{
	int i,j,n,t,res,tmp;
	scanf("%d",&t);
	while(t--)
	{
		res=0;
		scanf("%d",&n);
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		for(i=1;i<=n;i++)
			for(j=n;j>i;j--)
				if(a[j]<a[j-1])
				{
					res++;
					tmp=a[j];
					a[j]=a[j-1];
					a[j-1]=tmp;
				}
		printf("Optimal train swapping takes %d swaps.\n",res);
	}
	return 0;
}

D - ID Codes

题解:STL next_permutation

输出全排列中，当前数列的下一个，如果是最后一个，则输出“No Successor”

STL里的next_permutation可轻松输出全排列，还有一个pre_permutation,详情请参考百度,WIKI

源代码:

# include<cstdio>
# include<cstring>
# include<algorithm>
using namespace std;

const int maxn=55;
char s[maxn];

int main()
{
	int flag,len;
	while(scanf("%s",s)!=EOF&&s[0]!='#')
	{
		flag=0;
		len=strlen(s);
		while(next_permutation(s,s+len))
		{
			flag=1;
			printf("%s\n",s);
			break;
		}
		if(!flag)
			printf("No Successor\n");
	}
	return 0;
}

E - The Sultan's Successors

题解:DFS 回朔

经典八皇后问题，暴力搜索，统计和即可

源代码:

# include<cstdio>
# include<cstring>
# include<algorithm>
using namespace std;

const int maxn=10;
int q[maxn],a[maxn][maxn],maxres;

bool judge(int i,int j)     //第i行第j列
{
	int k;
	for(k=1;k<i;k++)
	{
		if(q[k]==j||abs(i-k)==abs(q[k]-j))
			return 0;
	}
	return 1;
}

void dfs(int pos,int n,int sum)
{
	int i;
	if(pos>n)
	{
		maxres=max(maxres,sum);
		return;
	}
	for(i=1;i<=n;i++)
		if(judge(pos,i))
		{
			q[pos]=i;
			dfs(pos+1,n,sum+a[pos][i]);
		}
}

int main()
{
	int t,i,j;
	scanf("%d",&t);
	while(t--)
	{
		maxres=0;
		for(i=1;i<=8;i++)
			for(j=1;j<=8;j++)
				scanf("%d",&a[i][j]);
		dfs(1,8,0);
		printf("%5d\n",maxres);
	}
	return 0;
}

F - Roman Numerals

=。=不好意思，读了一下午理解不了题意，找个了6级大牛还是没读懂，懂题意的跟我说下~~

G - Babelfish

题解:STL map应用

简单的map应用，map和sort是ACM比赛中极为重要的2个STL工具，不了解请百度之

源代码:

# include<cstdio>
# include<string>
# include<cstring>
# include<map>
using namespace std;

const int maxn=25;
char s[maxn],s1[maxn],s2[maxn];
map<string,string> smap;

int main()
{
	while(gets(s)&&strlen(s))
	{
		sscanf(s,"%s%s",s1,s2);
		smap[s2]=s1;
	}
	while(scanf("%s",s1)!=EOF)
	{
		if(smap.count(s1)==0)
			printf("eh\n");
		else
			printf("%s\n",smap[s1].c_str());
	}
	return 0;
}

H - Where is the Marble?

题解:简单hash

# include<cstdio>
# include<algorithm>
# include<cstring>
using namespace std;

const int maxn=100005;
int a[maxn];
int hash[maxn];

int main()
{
	int i,n,q,x,cas=1;
	while(scanf("%d%d",&n,&q)!=EOF&&(n+q))
	{
		memset(hash,0,sizeof(hash));
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		sort(a+1,a+n+1);
		for(i=1;i<=n;i++)
			if(!hash[a[i]])
				hash[a[i]]=i;
		printf("CASE# %d:\n",cas++);
		for(i=1;i<=q;i++)
		{
			scanf("%d",&x);
			if(hash[x]==0)
				printf("%d not found\n",x);
			else
				printf("%d found at %d\n",x,hash[x]);
		}
	}
	return 0;
}