acm题目与答案—d.docxVIP

目录消除方块2历史账单4序列求解6序列判定10括号匹配12消除方块#includeiostream using namespace std; int c[300][300];int a[300]={0}; int b[300]={0};int min(int a, int b); int main(){int n; cinn;for(int i=0;i=300;i++){for(int j=0;j=300;j++) c[i][j]=INT_MAX;}for( i=1;i=n;i++){ cina[i];}for(i=1;i=n;i++){cinb[i];}for(i=0;i=(n+1);i++){c[i][i]=0;c[i][i+1]=0;}for(int right=2;right=(n+1);right++){ int hhh=n+1-right;int right_2=right;for(int left=0;left=hhh;left++){ for(int k=left+1;kright_2;k++){c[left][right_2]=min(c[left][right_2],c[left][k]+c[k][right_2]+a[k]+b[left]+b[right_2]);}right_2++;}}coutc[0][n+1]endl; return 0;}int min(int a,int b){ return ab?a:b;}历史账单#includeiostream#includecstdio#includecstring#includealgorithm using namespace std; struct bills{int id,tp,t,p,c,ans; }b[100001];int tree[100001],n; int lowbit(int x){return x(-x);}void update(int i){while(i=n){tree[i]++;i=i+lowbit(i);}return ;}int query(int i){int ret=0; while(i0){ret+=tree[i]; i=i-lowbit(i);}return ret;}bool cmp1(bills x,bills y){return x.ty.t;}bool cmp2(bills x,bills y){if(x.c==y.c)return x.idy.id; return x.cy.c;}bool cmp3(bills x,bills y){return x.idy.id;}int main(){int i; while(scanf(%d,n)!=EOF){for(i=1;i=n;i++){b[i].id=i;scanf(%d%d%d,b[i].tp,b[i].t,b[i].c);}sort(b+1,b+1+n,cmp1);b[0].t=0;b[0].p=0;for(i=1;i=n;i++){if(b[i].t!=b[i-1].t)b[i].p=b[i-1].p+1; else b[i].p=b[i-1].p;}sort(b+1,b+1+n,cmp2);b[0].c=0;for(i=1;i=n;i++){if(b[i].c!=b[i-1].c)memset(tree,0,sizeof(tree)); if(b[i].tp==1)update(b[i].p);else b[i].ans=query(b[i].p);}sort(b+1,b+1+n,cmp3);for(i=1;i=n;i++)if(b[i].tp==2)printf(%d\n,b[i].ans);}return 0;}序列求解#includeiostream #include cstdio #include cmath #include string #include algorithm #include float.h using namespace std; #define INF 1e20 struct node{intindex,value;};int ans,n; double min_dist;node point[100000+5],combine[100000+5]; node min_a,min_b;int cmp(node a ,node b){return a.valueb.value;}inline double pow(int x){return x*x;}double dis(node a,node b){return sqrt(pow(b.index - a.index ) + pow( b.value - a.valu