摘要： 算法：计算期望值，算出每棵蘑菇的概率，再乘以其期望。View Code #include<stdio.h>#include<stdlib.h>#include<string.h>#include<map>#include<iostream>#include<algorithm>#include<vector>using namespace std;struct pnode{ int h, x, l, r;}p[100100];struct qnode{ int x, w;}q[11000];int N, M;i 阅读全文

摘要： 算法：1.表达式运算2.DFS枚举View Code #include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>#include<vector>#include<string>#include<math.h>#include<map>#include<set>#include<stack>#include<algorithm>using namespace std;stack< 阅读全文

摘要： 算法：1.1个栈寄存运算符，1个栈寄存操作数2.优先级用数组保存好View Code #include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>#include<vector>#include<string>#include<math.h>#include<map>#include<set>#include<stack>#include<algorithm>using namesp 阅读全文

摘要： C++ 中嵌入汇编View Code #include<iostream>using namespace std;int main(){ int a,b; while(scanf("%d%d",&a,&b)==2){ int *c=&a; __asm{ mov eax,c; mov eax,[eax]; mov ebx,b; lea eax,[eax+ebx]; mov a,eax; } cout<<a... 阅读全文

摘要： 算法：1.RMQ 求区间最值2.二分枚举段的数量，注意是段的数量和其和成正比，也就是枚举段的数量。View Code #include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>#include<vector>#include<string>#include<math.h>#include<map>#include<set>#include<algorithm>using namespace s 阅读全文