摘要:
#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>#include<cstdlib>using namespace std;const int maxn = 100010;int n;struct node{ int w,s;}floor[maxn];int cmp(node a,node b){ return a.w-b.s < b.w - a.s; }int main(){ //if(freopen("input.txt&qu 阅读全文
摘要:
轮换不等式性质: 1.可比性.2.传递性 1 #include<iostream> 2 #include<cstring> 3 #include<cstdio> 4 #include<cstdlib> 5 #include<algorithm> 6 using namespace std; 7 8 const int maxn = 10005; 9 struct emeny{10 int hp,apk;11 double ave;12 int time;1... 阅读全文
摘要:
只能说我被一个小错搞得好心痛,本一写好代码感觉写的还优美,但一个小的不能再小的 i 写出u ,害的我正正调了一天。还不的不与别人对比看。OMG!!具体的分析找别人的吧,说的比我好,要吃个苹果放松下#include <cstdio>#include <cmath>#include <algorithm>#include <iostream>#include <queue>#define maxn 1005using namespace std;const int INF = 0x3f3f3f;double mid;struct Edge 阅读全文