Virtualllll的博客

B - Necklace #include<iostream> #include<stdio.h> #include<string.h> typedef long long LL; using namespace std; int n,m; int v[20][20]; LL dp[(1<<18)+1][20]; int main() { ...

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 hands in the homework after th...

炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 31553 Accepted: 12180Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能是平原（用"P"表示），如下图。在每一格平原地形上最多可以布置一支炮兵部队...