北京林业大学“计蒜客”杯程序设计竞赛 网络赛

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,x;
int kai[500];
int shu[500];
int shi[500];
bool fafe[500];
int main()
{
while (scanf("%d%d",&n,&x)!=EOF)
{
for (int i=1;i<=n;i++)
scanf("%d",&kai[i]);
for (int i=1;i<=n;i++)
{
memset(fafe,true,sizeof(fafe));
int ge;
scanf("%d",&ge);
for (int j=0;j<ge;j++)
scanf("%d",&shu[j]);
sort(shu,shu+ge);
if (kai[i]==x)
shi[i]=0;
else if (kai[i]<x)
{
shi[i]=(x-kai[i])*5;
for (int j=0;j<ge;j++)
if (shu[j]>kai[i]&&shu[j]<x&&fafe[shu[j]])
{
shi[i]+=15;fafe[shu[j]]=false;
}
}
else
{
shi[i]=(kai[i]-x)*5;
for (int j=0;j<ge;j++)
if (shu[j]<kai[i]&&shu[j]>x&&fafe[shu[j]])
{
shi[i]+=15;fafe[shu[j]]=false;
}
}
}
printf("%d",shi[1]);
for (int i=2;i<=n;i++)
printf(" %d",shi[i]);
printf("\n");
}
return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int n,k;
int ge[12];
char ch[12][80];
char ju[4000][80];
int shu[4000];
int zhao(int xx,int yy)
{
int fafe=1;
for (int i=0;i+shu[xx]<=ge[yy];i++)
{
if (ju[xx][0]==ch[yy][i])
{
fafe=0;
for (int j=1;j<shu[xx];j++)
if (ju[xx][j]!=ch[yy][i+j])
{
fafe=1;
break;
}
if (fafe==0)
break;
}
}
return fafe;
}
int main()
{
int t;scanf("%d",&t);
while (t--)
{
memset(ju,0,sizeof(ju));
memset(shu,0,sizeof(shu));
scanf("%d",&n);
int p=80;
for (int i=1;i<=n;i++)
{
scanf("%s",ch[i]);
ge[i]=strlen(ch[i]);
p=min(p,ge[i]);
}
if (p<3)
{
printf("No significant commonalities\n");
continue;
}
k=0;
for (int i=0;i<ge[1];i++)
{
for (int j=0;j<ge[2];j++)
if (ch[1][i]==ch[2][j])
{
ju[k][0]=ch[1][i];
shu[k]=1;
for (p=1;i+p<ge[1]&&j+p<ge[2];p++)
{
if (ch[1][i+p]==ch[2][j+p])
{
ju[k][p]=ch[1][i+p];
shu[k]=p+1;
}
else
break;
}
k++;
}
}
if (n==2)
{
p=0;
for (int i=1;i<k;i++)
if (shu[i]>shu[p])
p=i;
else if (shu[i]==shu[p])
{
if (strcmp(ju[i],ju[p])<0)
p=i;
}
if (shu[p]<3)
{
printf("No significant commonalities\n");
continue;
}
else
{
for (int i=0;i<shu[p];i++)
printf("%c",ju[p][i]);
printf("\n");
}
}
else
{
for (int i=0;i<k;i++)
{
if (shu[i]<3)
shu[i]=0;
else
{
for (int j=3;j<=n;j++)
{
if (zhao(i,j))
{
shu[i]=0;
break;
}
}
}
}
p=0;
for (int i=0;i<k;i++)
if (shu[i]>shu[p])
p=i;
else if (shu[i]==shu[p])
{
if (strcmp(ju[i],ju[p])<0)
p=i;
}
if (shu[p]<3)
{
printf("No significant commonalities\n");
continue;
}
else
{
for (int i=0;i<shu[p];i++)
printf("%c",ju[p][i]);
printf("\n");
}
}
}
return 0;
}

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int v[15000];
int shu[500];
int n,k,s;
int renv[500];
int p[500];
int main()
{
while (scanf("%d",&n)!=EOF)
{
memset(shu,0,sizeof(shu));
memset(v,0,sizeof(v));
memset(renv,0,sizeof(renv));
for (int i=1;i<=n;i++)
{
scanf("%d",&renv[i]);
v[renv[i]]++;
}
k=0;s=0;
for (int i=1;i<=10000;i++)
if (v[i])
p[k++]=i;
for (int i=0;i<k;i++)
{
for (int j=1;j<=n;j++)
{
if (renv[j]==p[i])
{
shu[j]=max(shu[j-1],shu[j+1])+1;
s+=shu[j];
}
}
}
printf("%d\n",s);
}
}

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
char map[40][40];
char ch[1600];
char kkp[3000];
int n,m,k;
int main()
{
bool flag;
while (scanf ("%d %d",&n,&m)!=EOF)
{
flag=false;
k=0;
for (int i=0;i<n;i++)
{
scanf("%s",map[i]);
for (int j=0;j<m;j++)
{
if ('A'<=map[i][j]&&map[i][j]<='Z')
ch[k++]=map[i][j]+32;
else
ch[k++]=map[i][j];
}
}
scanf("%s",kkp);
int chang=strlen(kkp);
if (chang>k)
{
printf ("NO\n");
continue;
}
for (int i=0;i<chang;i++)
if ('A'<=kkp[i]&&kkp[i]<='Z')
kkp[i]+=32;
for (int i=0;i<=k-chang;i++)
{
if (ch[i]==kkp[0])
{
flag=true;
for (int j=1;j<chang;j++)
if (ch[i+j]!=kkp[j])
{
flag=false;
break;
}
}
if (flag)
break;
}
/*	if (!flag)
{
for (int i=k-1;i>=chang-1;i--)
{
if (ch[i]==kkp[0])
{
flag=true;
for (int j=1;j<chang;j++)
if (ch[i-j]!=kkp[j])
{
flag=false;
break;
}
}
if (flag)
break;
}
}*/
if (flag)
printf ("YES\n");
else
printf ("NO\n");
}
return 0;
}