摘要：
#include#include#include#includeusing namespace std;const int maxn = 1005;struct node{ double a,b,c;}Node[maxn];//double a[maxn],b[maxn],c[maxn],d[maxn];int m,n,k;double mid;int cmp(const void *i,const void *j){ return (*(struct node *)i).c >n>>k && n){ m = n - k; for(int i=0;i... 阅读全文
摘要：
#include#include#include#includeusing namespace std;const int maxn = 505;struct student{ int height; char gender; char m[105]; char s[105];}stu[maxn];bool G[maxn][maxn];int n,ans;int link[maxn];int vis[maxn];void init(){ memset(link,-1,sizeof(link)); memset(G,0,sizeof(G));}bool dfs... 阅读全文
摘要：
#include#include#include#includeusing namespace std;const int maxn = 1005;double a[maxn],b[maxn],c[maxn];int m,n,k;double L,R,mid;bool big(double p){ for(int i=0;in-1-m;i--) sum += c[i]; if(sum >= 0) return true; else return false;}int main(){ //if(freopen("input.txt","r",stdi 阅读全文