Codeforces Round #418 (Div. 2) Codeforces 814A-D

一句话题解系列。
A An abandoned sentiment from past
把$b$数组从大到小从左到右插入。

#include<cstdio>
#include<algorithm>
using namespace std;
int a[110],b[110],n,k;
int main()
{
    scanf("%d%d",&n,&k);
    for (int i=1;i<=n;i++) scanf("%d",&a[i]);
    for (int i=1;i<=k;i++) scanf("%d",&b[i]);
    sort(b+1,b+k+1);
    for (int i=1;i<=k;i++)
        for (int j=n;j;j--)
            if (!a[j])
            {
                a[j]=b[i];
                break;
            }
    for (int i=2;i<=n;i++)
        if (a[i]<a[i-1])
        {
            printf("Yes\n");
            return 0;
        }
    printf("No\n");
}

B An express train to reveries
找见$a$和$b$数组自身矛盾的地方大力讨论。

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1010;
int a[maxn],b[maxn],posa[maxn],posb[maxn],n;
int main()
{
    int x,y,x1,y1,pa1,pa2,pb1,pb2;
    scanf("%d",&n);
    for (int i=1;i<=n;i++) scanf("%d",&a[i]);
    for (int i=1;i<=n;i++) scanf("%d",&b[i]);
    for (int i=1;i<=n;i++)
        if (!posa[a[i]]) posa[a[i]]=i;
        else
        {
            x=a[i];
            pa1=posa[a[i]];
            pa2=i;
        }
    for (int i=1;i<=n;i++)
        if (!posa[i]) x1=i;
    for (int i=1;i<=n;i++)
        if (!posb[b[i]]) posb[b[i]]=i;
        else
        {
            y=b[i];
            pb1=posb[b[i]];
            pb2=i;      
        }
    for (int i=1;i<=n;i++)
        if (!posb[i]) y1=i;
    if (pa1==pb1||pa1==pb2)
    {
        if (pa1==pb1&&pa2==pb2) a[pa2]=y;
        else
        {
            a[pa2]=b[pa2];
            if (a[pa2]==x) a[pa1]=x1;
        }
    }
    else if (pa2==pb1||pa2==pb2)
    {
        a[pa1]=b[pa1];
        if (a[pa1]==x) a[pa2]=x1;
    }
    else
    {
        a[pa1]=b[pa1];
        a[pa2]=b[pa2];
    }
    for (int i=1;i<=n;i++)
        printf("%d ",a[i]);
}

C An impassioned circulation of affection
$O(26n^2)$dp预处理出所有答案。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=1510;
char s[maxn];
int f[maxn][maxn],g[maxn][maxn],ans[maxn][30],n;
int main()
{
    //freopen("3.in","r",stdin);
    int q,x;
    char c;
    scanf("%d",&n);
    scanf("%s",s+1);
    for (int j=1;j<=26;j++)
    {
        for (int i=1;i<=n;i++)
            for (int k=0;k<=n;k++)
            {
                if (s[i]-'a'+1==j) f[i][k]=f[i-1][k]+1;
                else if (k) f[i][k]=f[i-1][k-1]+1;
                else f[i][k]=0;
                g[i][k]=max(f[i][k],g[i-1][k]);
            }
        for (int i=0;i<=n;i++) ans[i][j]=g[n][i];
    }
    scanf("%d",&q);
    while (q--)
    {
        scanf("%d %c",&x,&c);
        printf("%d\n",ans[x][c-'a'+1]);
    }
}

D An overnight dance in discotheque
按照包含关系从大到小贪心，加上第一层和偶数层，减掉大于一的奇数层。

#include<cstdio>
#include<queue>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=1010;
const double eps=1e-8,pi=acos(-1);
vector<int> son[maxn];
queue<int> que;
double xx[maxn],yy[maxn],rr[maxn];
int du[maxn],dep[maxn],n;
int main()
{
    int u;
    double ans=0;
    scanf("%d",&n);
    for (int i=1;i<=n;i++) scanf("%lf%lf%lf",&xx[i],&yy[i],&rr[i]);
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            if (j!=i&&rr[j]+eps<rr[i]&&sqrt((xx[i]-xx[j])*(xx[i]-xx[j])+(yy[i]-yy[j])*(yy[i]-yy[j]))+rr[j]<=rr[i]+eps)
            {
                son[i].push_back(j);
                du[j]++;
            }
    for (int i=1;i<=n;i++) if (!du[i]) que.push(i),dep[i]=1;
    while (!que.empty())
    {
        u=que.front();
        que.pop();
        if (dep[u]==1||(dep[u]&1)==0) ans+=pi*rr[u]*rr[u];
        else ans-=pi*rr[u]*rr[u];
        for (vector<int>::iterator it=son[u].begin();it!=son[u].end();++it)
        {
            dep[*it]=max(dep[*it],dep[u]+1);
            if (--du[*it]==0) que.push(*it);
        }
    }
    printf("%.8f\n",ans);
}