zxf654073270的专栏

题目是这样的 Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius

#include #include #include using namespace std; int dp[20][5000],num,A[5000],mark[25][5000],n,map[25][25]; int max(int a,int b) { return a>b?a:b; } int first() {     num=0; int a,j,i;

#include #include #include using namespace std; int Max(int a,int b) {     return a>b?a:b; } struct node {     int ii;     int number; }f[200]; int dp[110][200][200],num; int first(i

状态压缩水题

简单状态压缩dp

状态压缩dp 或深搜

状态压缩

最短路+状态压缩dp