2020HDU多校第二场

1006 斐波拉契相关

#include<cstdio>
#include<iostream>
using namespace std;
typedef unsigned long long ull;
const int N =  3e6;
ull f[N] = {0,1,2,3};
int main(){
    for(int i = 4 ; i <= N ; i++)   f[i] = f[i-1] + f[i-2];
    int t ,m,n,x; scanf("%d",&t);
    while(t--){
        ull a=0,b=0,c=0;
        scanf("%d",&n);
        for(int i = 1 ; i <= n ; i++){
            scanf("%d",&x);  a+= f[i]*(ull)x;
        }scanf("%d",&m);
        for(int i = 1 ; i <= m ; i++){
            scanf("%d",&x);  b+= f[i]*(ull)x;
        }scanf("%d",&m);
        for(int i = 1 ; i <= m ; i++){
            scanf("%d",&x);  c+= f[i]*(ull)x;
        }
        a *= b;//printf("%lld %lld %lld\n",a,b,c);
        int i;
        for( i = 1 ;  c+f[i] != a ; i++);
        printf("%d\n",i);
    }
    return 0;
}

1010 爆搜

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
#include<set>
#include<cstdlib>
#include<cstdlib>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
int num[55],vis[55],tot;
ll val[55][55][5],ans;
ll ma(ll a, ll b){return a>b?a:b;}
void dfs(int pos,ll a,ll b,ll c,ll d){//printf("%d\n",pos);
    if(pos > tot){
        ans = ma(ans , a*b*c*d);return ;
    }
    for(int i = 1 ; i <= num[pos] ; i++)
        dfs(pos+1,a+val[pos][i][1],b+val[pos][i][2],c+val[pos][i][3],d+val[pos][i][4]);
}
int main(){
    int t,k,n,x,a,b,c,d;
    scanf("%d",&t);
    while(t--){
        scanf("%d %d",&n,&k);tot = 0;
        for(int i = 1 ; i <= n ; i++){
            scanf("%d",&x);
            if(vis[x] == 0)    vis[x] = ++tot;
            num[vis[x]]++;
            for(int j = 1 ; j <= 4 ; j++)
            scanf("%lld",&val[vis[x]][num[vis[x]]][j]);
        }
        ans = 0;
        dfs(1,100,100,100,100);
        printf("%lld\n",ans);
        memset(num,0,sizeof(num));
        memset(vis,0,sizeof(vis));
    }
    return 0;
}

1012DP

#include<cstdio>
#include<cstring>
const int N=100010,M=25,S=26;
int Case,n,m,q,i,j,l,r,g[N][S],f[M][M];char a[N],b[M];
inline void up(int&a,int b){a>b?(a=b):0;}
inline int cal(int l,int r){
  int i,j;
  for(i=0;i<=m;i++)for(j=0;j<=i;j++)f[i][j]=N;
  f[0][0]=l-1;
  for(i=0;i<m;i++)for(j=0;j<=i;j++){
    up(f[i+1][j],f[i][j]);
    if(f[i][j]<r)up(f[i+1][j+1],g[f[i][j]+1][b[i+1]]);
  }
  for(i=m;i;i--)for(j=i;j<=m;j++)if(f[j][i]<=r)return i;
  return 0;
}
int main(){
  scanf("%d",&Case);
  while(Case--){
    scanf("%s%s",a+1,b+1);
    n=strlen(a+1),m=strlen(b+1);
    for(i=1;i<=n;i++)a[i]-='a';
    for(i=1;i<=m;i++)b[i]-='a';
    for(j=0;j<S;j++)g[n+1][j]=n+1;
    for(i=n;i;i--){
      for(j=0;j<S;j++)g[i][j]=g[i+1][j];
      g[i][a[i]]=i;
    }
    scanf("%d",&q);
    while(q--)scanf("%d%d",&l,&r),printf("%d\n",r-l+1+m-2*cal(l,r));
  }
}