PPXppx

该文被密码保护。 阅读全文

摘要： "HDU" 题意:姓名由姓和名两部分组成,每个部分都含有n个字符,现在一共有m个字符,求姓和名不含相同字符的姓名数量.$(n,m include include include include include include include define ll long long using nam 阅读全文

摘要： "HDU" 题意:给定一个长度不超过5000的字符串s,求它的两个不重叠的长度都为$n$的连续子串$s1,s2$,使得$dis(s1,s2) include include include include include include include define ll long long usi 阅读全文

摘要： "HDU" 题意:给定$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char c 阅读全文

摘要： "HDU1158" 题意:有$n(nk,f[i][j]=min(f[i][j],f[i 1][k]+a (j k)+b j)$ 初始化$f[0][0]=0$,其余赋值无穷大. 枚举的时候,第i个月至少需要$Need[i]$个工人,这是下界;然后雇佣的工人数量不应该超过$maxn(maxn=max_{ 阅读全文

摘要： "洛咕" 题意:把一个包含$n$个正整数的序列划分成$m$段$(1 include include include include include include include define ll long long using namespace std; inline int read(){ 阅读全文

摘要： "洛咕" "POJ" 题意:一共有$N (1 include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1 阅读全文

摘要： "洛咕" 题意:从起点驾车出发到距离为m的城镇,初始油量为k,油箱容量无穷大,途中有$n(n include include include include include include include define ll long long using namespace std; inline 阅读全文

摘要： "POJ" 题意:给定$N(N include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char c 阅读全文

摘要： "洛咕" 题意:$N(N include include include include include include include define ll long long using namespace std; inline int read(){ int x=0,o=1;char ch=g 阅读全文