PPXppx

摘要： "洛咕" 一句话题意:给定$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 阅读全文

摘要： "洛咕" 题意:给定$m$个有序对$(a,b)$,构造一个$n$的排列,满足$m$个有序对中$a$均排在$b$的前面,且1尽量靠前,在1尽量靠前的前提下,2尽量靠前,....以此类推.$n,m include include include include include include inclu 阅读全文

摘要： "BZOJ" 题意:在一款电脑游戏中，你需要打败$n(n include include include include include include include define ll long long using namespace std; inline int read(){ int x 阅读全文

摘要： "洛咕" 题意:两个人各有n匹马,给出每匹马的速度,n场比赛中,问第一个人最多能赢多少场.$n include include include include include include include define ll long long using namespace std; inlin 阅读全文

摘要： "洛咕" 题意:在一条线段上有许多点.这些点可以用3n个整数来表示，每行的三个整数分别为$S_i,E_i,D_i$，表示有许多个点在$S, S + D, S + 2D, …, S + KD (K \in Z, S + KD ≤ E, S + (K + 1)D E)$位置。求在这一条线段上是否有一个点 阅读全文

摘要： "洛咕" 题意:有$n$种物品,第$i$种体积为$V_i$，价值为$W_i$，共有$D_i$件.的背包体积是$C$.还有m件奇货,第$i$件的价值$Y_i$与分配的体积$X_i$之间的关系为$Y_i=a_i X_i^2+b_i X_i+c_i$.求最大价值.$1≤n,C≤10000,1≤m≤5,1≤ 阅读全文

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

摘要： "洛咕" 题意:有$2^n$个人要进行比赛，每次$2i$与$2i+1$号人进行比赛.这一轮中赢的人进入下一轮.下一轮比赛的时候把进入这一轮的人按编号排好，仍然是像之前那样相邻的进行一次比赛.最后只剩下一个人.数据给出对于$ x,y$，$x$打赢$y$的概率.第$i$轮比赛会角逐出$2^{n i}$个 阅读全文

摘要： "洛咕" 题意:给定整数$n$和$k$,构造一个长度为$2 n$的排列,满足:$\sum_{i=1}^{n}\mid{a_{2i} a_{2i 1}}\mid \mid\sum_{i=1}^{n} a_{2i} a_{2i 1} \mid=2 k$ 分析:一看到排列,就知道是要找性质了.首先不难发现 阅读全文

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