Napoleon2004的博客

#include<bits/stdc++.h>using namespace std;string s;int x,y,i,j,len,cas,d[1010];bool a[1010][1010];int main(){ scanf("%d\n",&cas); while(cas--){ getline(cin,s); len=s.size(); me...

#include<bits/stdc++.h>using namespace std;int s,m,n;int c[130],st[130],d[130][300][300];int dp(int i,int s0,int s1,int s2){ if(i==m+n)return s2==(1<<s)-1?0:1e9; int& ans=d[i][s1...

#include<bits/stdc++.h>using namespace std;int d[10010][3];vector<int>s[10010];void dp(int u,int pre){ if(s[u].size()==1&&pre!=0){ d[u][0]=1; d[u][1]=0; d[u][2]=1e5; r...

#include<bits/stdc++.h>using namespace std;int n,len,d[210][2],f[210][2];string name[210];vector<int>sons[210];int search(string s){ for(int i=1;i<=len;i++) if(name[i]==s) re...

#include<bits/stdc++.h>using namespace std;int n,t,i,j;vector<int>sons[100010];int dp(int u){ if(sons[u].empty())return 1; int i,k=sons[u].size(); vector<int>d; for(i=0;i<...

#include<bits/stdc++.h>using namespace std;int n,x[60],y[60];double dp[60][60];double s(int i,int j,int k){ return fabs((x[j]-x[i])*(y[k]-y[i])-(x[k]-x[i])*(y[j]-y[i]))/2.0;}bool check(in...

#include <bits/stdc++.h>using namespace std;const int maxn = 100+5;char S[maxn];int n,d[maxn][maxn];bool match(char a,char b){ return (a=='('&&b==')')||(a=='['&&b==']...

#include<bits/stdc++.h>using namespace std;int n,l,i,j,k,a[110],d[110][110];int main(){ while(scanf("%d",&l)&&l){ scanf("%d",&n); memset(d,0x3f3f3f3f,sizeof(d)); d[0][1...

#include<bits/stdc++.h>using namespace std;int i,j,v1,v2,l1,l2,cas;int sq[26],sp[26],eq[26],ep[26];int d[5010][5010],c[5010][5010];char q[5010],p[5010];int main(){ scanf("%d",&cas); ...

题目描述给出一个长度不超过 200200 的由小写英文字母组成的字母串(约定;该字串以每行 2020 个字母的方式输入，且保证每行一定为 2020 个)。要求将此字母串分成 kk 份( 1<k \le 401<k≤40 )，且每份中包含的单词个数加起来总数最大(每份中包含的单词可以部分重叠。当选用一个单词之后，其第一个字母不能再用。例如字符串 thisthis 中可包含 thist...

#include<bits/stdc++.h>using namespace std;int n,m;int tz[200],d[2100][2100];int dp(int a,int s){ if(d[a][s]!=0x3f3f3f3f)return d[a][s]; int i,t,sum=0; for(i=1;i<=m;i++) if((tz[i]&am...

#include<bits/stdc++.h>using namespace std;int k,i,j,ans;long long n,d[110][70];int main(){ while(scanf("%d%lld",&k,&n)&&k&&n){ memset(d,0,sizeof(d)); ans=0x3f3f...

#include<bits/stdc++.h>using namespace std;int s[1010],d[1010];struct node{ int v,k,c,l;}a[1010];int cmp(node x,node y){ return x.v<y.v;}int main(){ int n,i,j; while(scanf("%d",&am...

#include<bits/stdc++.h>using namespace std;int a[42][6],dp[42][42][42][42],baslen[42][42][42][42],basket[42][42][42][42][6];bool b[42][42][42][42];void cal1(int i,int j,int q,int p){ if(i==...

#include<bits/stdc++.h>using namespace std;int t,n,m,i,j,ans,c[10]={0,-1,0,1},d[10]={-1,0,1,0},a[1010][1010],b[1010][1010];string s;int ss(int x,int y){ if(x>n||y>m||x<1||y<1)re...

#include<bits/stdc++.h>using namespace std;int n,t,i,j,sum,cas,num,a[200],s[20010];int song_type,song_length;int main(){ scanf("%d",&num); for(cas=1;cas<=num;cas++){ scanf("%d%d",...

#include<bits/stdc++.h>using namespace std;int v,i,j,k,n,m,ans,fir,a[110][110],d[110][110],nex[110][110];int Inf=0x3f3f3f3f;int main(){ while(scanf("%d%d",&m,&n)==2){ for(i=0;i&lt...

#include<bits/stdc++.h>using namespace std;const int m=1010;int n,i,j,a[m],b[m];double d[m][m];double dist(int x,int y){ return sqrt((a[x]-a[y])*(a[x]-a[y])+(b[x]-b[y])*(b[x]-b[y]));}int...

#include<bits/stdc++.h>using namespace std;int n,ans,a[40][3],dp[40][3];int search(int i,int j){ int k,x,t1,t2,t3,t4; if(dp[i][j])return dp[i][j]; dp[i][j]=a[i][j]; if(j==0){t1=a[i][1];t2...

#include<bits/stdc++.h>using namespace std;int n,m,T,t,i,j,k,a[310],train1[310][310],train2[310][310],dp[310][310];int main(){ while(scanf("%d",&n)&&n){ k++; scanf("%d",&...

#include<bits/stdc++.h>using namespace std;double v,kase,vis[1010][1010][2],f[1010][1010][2];int n;struct node{ double l,tt,pl;}a[1010];double add(int i,int j){ return a[j].l-a[i-1].l;}...

#include<bits/stdc++.h>using namespace std;const int M=100;int n,m,b[M],c[M],ans[M],a[M][M];int ord[M][M],sum[M][M],rec[M][M][M],dp[M][M][M][M];bool check(int u,int l,int r){ int i; ...