Y251673671的专栏

<br />//Accepted 1160 15MS 264K 1027 B C++ <br />//dp题 转化为求最长子序列问题 <br />#include<iostream><br />#include<cstdio><br />#include<string><br />#include<algorithm><br />using namespace std;<br />struct node{<br /> int weight;<br /> int speed;<br /> int order;

<br />//2562511 2010-06-29 17:53:55 Accepted 1087 31MS 236K 517 B C++ <br />//DP简单题 <br />#include <iostream><br />#include<string.h><br />#include<cstdio><br />#define max_size 1002<br />using namespace std;<br />int main()<br />{<br /> int dp[max_size];<

<br />//2563204 2010-06-30 12:34:06 Accepted 1058 62MS 256K 947 B C++ <br />#include<iostream><br />#include<stdio.h><br />#include<string><br />#define max_size 2000000001<br />using namespace std;<br />int main()<br />{<br /> int hash[5850];<br /> int us

<br />//2562465 2010-06-29 17:20:23 Accepted 1159 31MS 3240K 835 B C++ T&T <br />#include <iostream><br />#include<string.h><br />#include<cstdio><br />#define max_size 10000 <br />using namespace std;<br />int dp[max_size + 1][max_size + 1];<br />char str

<br />//对接触面的面积排序 转化为求最大子序列问题<br />#include<iostream><br />#include<cstdio><br />#include<algorithm><br />#define max_size 0x7fffffff<br />using namespace std;<br />struct node{<br /> int high;<br /> int length;<br /> int wide;<br />}bl[92];<br />int dp[92

//dfs//Accepted 1074 31MS 2700K 1613 B C++ #include#include#include#includeusing namespace std;int n;struct node{ int time,cost; int path[17];};node dp[1struct obj{ int cost; int deadline; char name[105];}job[17];void bfs(){ int i,j,tpath[17],tt,u; int p,N