Dear Battle Companion , I see you......
原创
2010-04-13 16:40:58
309阅读
题意：n m(武器种类n，塔m血) 目标，计算推到塔最短时间下面n行a b表示建该武器需要a秒，建成后每秒造成m血 果果的完全背包 #include#include#include#include#include#include#include#define N 40#define M 400using namespace std;i
原创
2021-08-13 13:35:07
51阅读
The Battle of ChibiTime Limit: 6000/4000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Cao Cao made up a big army and was going to invade ...
转载
2015-10-29 17:07:00
69阅读
2评论
Battle ShipsTime Limit...
转载
2019-04-16 14:35:00
43阅读
2评论
给一个n，要求构造一个矩阵，满足： 1、矩阵大小为(2n+1)*(2n+1) 2、沿对角线对称 3、每一个数的值在[0,2n+1]上 4、每行每列没有反复的值 手动写了一下 直接找到规律。。 #include<cstdio> #include<cstring> using namespace std
转载
2017-04-17 15:05:00
96阅读
2评论
[1329] Last Battle时间限制: 1000 ms 内存限制: 65535 K 问题描述TT and her army exterminated the big boss and his demons successfully, but TT's army suffered great losses. they met the final boss, what? anoth
原创
2023-04-24 03:36:34
264阅读
The Battle of GuanduTime Limit: 6000/3000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)In the year of 200, two generals whose names are C...
转载
2015-10-29 22:16:00
85阅读
2评论
Battle for SilverTime Limit: 2999/999MS (Java/Others) Memory Limit: 65432/65432KB (Java/Others)Piet Hein was a Dutch naval officer during the Eighty ...
转载
2014-08-29 12:52:00
173阅读
2评论
Battle ShipsTime Limit...
转载
2019-04-16 14:35:00
32阅读
2评论
[题目链接] http://acm.hdu.edu.cn/showproblem.php?pid=5542 [算法] 树状数组优化DP [代码]
转载
2018-07-19 17:06:00
108阅读
2评论
题目题意：给定n个城市以及相应
原创
2023-06-27 10:25:06
74阅读
最开始的时候我就想制作一个90坦克的demo，之前看了其他的游戏引擎感觉不好搞，后来用了godot感觉可以研究一下，最近学着做了一些。虽然看起来可能跟原版有差距，但是大部分功能都有了，增加...
转载
2021-03-24 23:04:00
205阅读
2评论
E. Battle Lemmings （DP)
思路：dpdpdp。
不会写，参考别人的代码，
ans=n(n−1)2−cnt1(cnt1−1)2−cnt1(n−cnt1)−∑continuous_pair(0,0)ans=\dfrac{n(n-1)}{2}-\dfrac{cnt_1(cnt_1-1)}{2}-cnt_1(n-cnt_1)-\sum continuous\_pair(0,0)ans=2n(n−1)−2cnt1(cnt1−1)−cnt1(n−cnt1)−∑continuous_pa
原创
2021-08-10 09:18:29
87阅读
传送门f[i][j] 表示1--i 选j个的情况 先离散化 , 然后开n个树状数组分别维护 f[][j] #include<bits/stdc++.h>#define N 1005#define Mod 1000000007#define LL long longusing namespace std;int T,n,m,a[N],b[N];LL f[N]
原创
2022-07-05 10:28:19
61阅读
1001 Battle Over Cities - Hard Version 思路：暴力跑每一个点作为被侵
原创
2022-11-03 15:25:26
70阅读
B - Battle Ships Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice ZOJ 3623Appoint description:DescriptionBattl...
原创
2021-07-16 14:56:08
64阅读
令$f_{i}$（一个集合）表示当第$i$步开始时第0方必胜当且仅当$x\in f_{i}$，初始$f_{n+1}=\{0\}$ 当$p_{i}=0$时，$f_{i}=\{x|x\in f_{i+1}或(x\oplus a_{i})\in f_{i+1}\}$；当$p_{i}=1$，$f_{i}=\
转载
2020-12-17 18:43:00
152阅读
2评论
Battle Ships is a new game which is similar to Star Craft. In this game, the enemy builds a defense tower, which has L longevity. The player has a military
factory, which can produce N kinds of bat
转载
2017-05-12 15:00:00
42阅读
2评论
题意 给出长度为n的序列，问这个序列中有多少个长度为m的单调递增子序列。 $1\le M\le N\le 1000$ 分析 用F[i,j]表示前j个数构成以Aj为结尾的数列中，长度为i的严格递增子序列有多少个 $$ F[i,j]=\sum_{k include define rg register
转载
2019-04-17 16:56:00
63阅读
2评论
It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we nee
原创
2023-09-05 09:29:27
26阅读
