The_star_is_at的博客

const int maxn=6;double p[maxn]={0.00,0.15,0.10,0.05,0.10,0.20};double q[maxn]={0.05,0.10,0.05,0.05,0.05,0.10};int root[maxn][maxn];double w[maxn][maxn],ee[maxn][maxn];void BST(){ for(int i=

//// main.cpp// yybhjbl//// Created by liuzhe on 17/10/21.// Copyright © 2017年 liuzhe. All rights reserved.//#include #include #include #include #include #include #include #include

//// main.cpp// yybhjbl//// Created by liuzhe on 17/10/21.// Copyright © 2017年 liuzhe. All rights reserved.//#include #include #include #include #include #include #include #include

const int maxn=100;int n,a[maxn][maxn],ans,zero,one;bool judge(){ return n*(n+1)/2%2;}bool bound(int x){ memset(a,0,sizeof(a)); for(int i=1;i<=n;i++) { a[1][i]=x%2;

//最优服务次序问题int n;int a[100];int main(){ cin>>n; for(int i=0;i>a[i]; sort(a,a+n); int ans=0; for(int i=0;i<n;i++) ans+=a[i]*(10-i); printf("%.2f\n",1.0*ans/n); return 0;}*//*Input:1056

//汽车加油问题int n,k,a[100],ans;vectorvec;int main(){ cin>>n>>k; for(int i=0;i>a[i]; int oil=n; for(int i=1;i<=k;i++) { oil-=a[i-1]; if(a[i]>oil) { ans++; oil=n; vec.push_back(i-1);

//区间相交问题int n;struct node{ int x,y; bool operator<(const node &s)const { if(y!=s.y) return y<s.y; return x<s.x; }}a[100];int main(){ cin>>n; int ans=0; for(int i=0;i<n;i++) { cin>>

//流水作业调度const int maxn=5;int a[]={2,4,3,6,1};int b[]={5,2,3,1,7};int c[maxn];struct node{ int key,id; bool job;};int cmp(const node &a,const node &b){ return a.key<=b.key;}int f

const int maxn=100;int a[maxn][maxn];int dp[maxn][maxn];int main(){ int n; cin>>n; memset(a,0,sizeof(a)); memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) for(int j=1;j<=

const int maxn=100;int a[maxn];void Merge_Array(int l,int r){    int m=(l+r)>>1;    int i=l,j=m+1,n=r;    int k=0;    int tmp[maxn];    while(i    {        if(a[i]a[j])tmp[k++]=a[i

int n,a[10];int solve(int l,int r){    if(l==r)return a[l];    returnmax(solve(l,(l+r)/2),solve((l+r)/2+1,r));}int main(){    cin>>n;    for(int i=0;in;i++)cin>>a[i];    cout

const int maxn=100;const int inf=0x3f3f3f3f;int a[maxn],n,m;struct node{ int data; bool operator<(const node &a)const { return data>a.data; }};priority_queueque;int main

const int INF=0x3f3f3f3f;const int MAXN=1000010;struct qnode{ int v; int c; qnode(int _v=0,int _c=0):v(_v),c(_c){} bool operator <(const qnode &r)const { return c>r.c;

from SIAM News, Volume 33, Number 4The Best of the 20th Century: Editors Name Top 10 AlgorithmsBy Barry A. CipraAlgos is the Greek word for pain.Algor is Latin, to be cold. Neither is

int a[205],d[205];int main(){ int n,ans; while(cin>>n) { memset(d,0,sizeof(d)); for(int i=1;i>a[i]; d[1]=1; for(int i=2;i<=n;i++) { an

int n;int ans[100][100],a[100],s[100][100];void dfs(int l,int r);int main(){ while(cin>>n) { memset(ans,0,sizeof(ans)); for(int i=0;i>a[i]; for(int i=1;i<n;i++)

//循环赛日程表//思路：分治策略。使用递归函数分割，直到剩下两个人。//姓名：刘哲；学号：2015214189#include //头文件void table(int n);//函数声明void print(int n);//输出函数const int maxn=1e4;//假设最大人数int s[maxn][maxn];//表int n;int main(){ wh