AtCoder Grand Contest 019

最近比较懒，写了俩题就跑了

A - Ice Tea Store

简化背包

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

long long a,b,c,d,A,B,C,D,n,m;
long long min(long long a,long long b){return a<b?a:b;}
int main(){
    scanf("%lld%lld%lld%lld%lld",&a,&b,&c,&d,&n);n*=;
    A=a*;B=b*;C=c*;D=d;
    if (A>B) A=B;
    if (A>C) A=C;
    if (A>D) A=D;

    printf("%lld\n",n/*A+(n%==?min(a*,min(c,min(a*+b,b*))):));
}

B - Reverse and Compare

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
using namespace std;

const int N = ;
char s[N], str[N*];
int p[N*],a[N];
long long manacher()
{
    int i;
    for(i = ; s[i]; i++)
        str[i*] = s[i], str[i*+] = '#';
    str[] = '?', str[] = '#', str[i*] = '\0';
    int res = , k = , maxk = ,n=strlen(s+);
    long long mmh=1LL*n*(n+)/;
    for (int i=;i<=n;i++){
        a[s[i]]++;
        mmh-=a[s[i]];
    }
    return mmh+;
}

int main()
{
    scanf(" %s", s + );
    printf("%lld\n", manacher());
    return ;
}

哇，后面的就永久留坑吧