摘要： http://blog.csdn.net/acm_cxlove/article/details/8079348 阅读全文

摘要： #include#include#define N 1100int dp[N],a[N];int main() {int n,m,i,j,max,k;while(scanf("%d",&n),n) {max=0;k=0;for(i=1;imax) {max=a[i];k=i;}}scanf("%d"... 阅读全文

摘要： #include#include#define N 1100int dp[N];int main() {int n,t,m,a[N],b[N],i,j,v;scanf("%d",&t);while(t--) {scanf("%d%d",&n,&v);for(i=1;i=b[i];j--)if(dp[... 阅读全文

摘要： #include#include#include//只存在一个连通分量#includeusing namespace std;#define N 11000#define NN 110000struct node {//链表实现int v,next;}bian[NN];int sta[N];//数组... 阅读全文

摘要： #include#include#include#include#include#includeusing namespace std;#define inf 1000000000#define N 2100vectorh[N];//stackq;///int dfn[N],low[N],index... 阅读全文

摘要： #include#include#include#includeusing namespace std;#define inf 999999999#define N 300struct node { int u,v,w,next;}bian[N*10];int yong,n,head[N];voi... 阅读全文

摘要： http://www.cppblog.com/kerorohttp://blog.csdn.net/xuezhongfenfei/article/details/8685313 阅读全文

摘要： #include#include#include#includeusing namespace std;#define inf 1000000000#define N 31000#define NN 151000struct node {int u,v,w,next;}bian[NN];int n,... 阅读全文

摘要： 参考 http://blog.csdn.net/zhuyingqingfen/article/details/6370561刘汝佳白皮书#include#include#include#includeusing namespace std;#define N 2100#define inf 1000... 阅读全文

摘要： #include#include#include#includeusing namespace std;#define N 2100struct node {int u,v,w,next;}bian[N];int n,m,yong,head[N];void creat(int u,int v,int... 阅读全文