摘要:
"POJ" 题意:有$N$对数,每对数由$(a_i,b_i)$组成,现在要求选出$M$对数,在$|\sum a_i \sum b_i|$最小的前提下,保证$\sum a_i+\sum b_i$最大.输出$\sum a_i,\sum b_i$以及任意一种方案.$1 include include in 阅读全文
摘要:
"POJ" 题意:给定一个长度为N($N include include include include define LL long long using namespace std; inline LL read(){ LL s=0,w=1;char ch=getchar(); while(ch 阅读全文
摘要:
"洛咕" 题意:司令部的将军们打算在N M的网格地图上部署他们的炮兵部队。一个$N M$($N include include include using namespace std; inline int read(){ int s=0,w=1;char ch=getchar(); while(c 阅读全文
摘要:
"POJ" 题意:有$N(N include include include include using namespace std; inline int read(){ int s=0,w=1;char ch=getchar(); while(ch'9'){if(ch==' ')w= 1;ch= 阅读全文