状态压缩DP
文章平均质量分 54
我是一位爱编程的蒟蒻
我是一位爱编程的蒟蒻
展开
-
Sitting In The Line(百度之星初赛, 超能力Coding 4370)
#include <iostream> #include <cstdio> using namespace std; int a[100010]; int p[29]; int dp[1 << 20][20]; int b[29]; const int inf = 1500000000; void checkmax(int & a, const int & b) { if(b > a) a = b; } int main() {原创 2022-03-31 17:53:47 · 63 阅读 · 0 评论 -
TSP问题
TSP问题 (POJ3311/HDU5067/HDU5418/HDU1217) 采用 POJ3311POJ3311POJ3311 的题面 Description The Pizazz Pizzeria prides itself in delivering pizzas to its customers as fast as possible. Unfortunately, due to cutbacks, they can afford to hire only one driver to do the原创 2022-03-31 17:25:30 · 116 阅读 · 0 评论