SF
nucleare
这个作者很懒,什么都没留下…
展开
-
Rain on your Parade HDU - 2389 (二分匹配,Hopcroft-Karp算法)
Rain on your Parade HDU - 2389 You’re giving a party in the garden of your villa by the sea. The party is a huge success, and everyone is here. It’s a warm, sunny evening, and a soothing wind send...原创 2019-01-17 14:35:20 · 153 阅读 · 0 评论 -
D. Cutting Out ( cf 1077D) (二分)
D. Cutting Outtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array ss consisting of nn integers.You have to ...原创 2018-11-17 16:03:09 · 445 阅读 · 0 评论 -
Lucky Man ZOJ - 4005 (JAVA大整数+牛顿迭代法开根)
Lucky Man ZOJ - 4005 BaoBao is keen on collection. Recently he is abandoning himself to Kantai Collection, especially to collecting cute girls, known as "Fleet Girls".There are various types ...原创 2018-10-22 21:28:48 · 471 阅读 · 0 评论 -
B - Children of the Candy Corn(双dfs+bfs)
The cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through the maze facing zombies, chainsaw-wielding psychopaths, hippies, and other terrors on their que...原创 2018-05-24 21:10:25 · 139 阅读 · 0 评论 -
D - 棋盘问题 (dfs经典题)poj1321
在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <= n 当为-1...原创 2018-05-22 21:40:03 · 823 阅读 · 0 评论 -
Catch That Cow(bfs启蒙题)
Catch That Cow(百练4001)Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a ...原创 2018-04-22 20:56:12 · 305 阅读 · 0 评论 -
A - 棋盘问题
A - 棋盘问题 在一个给定形状的棋盘(形状可能是不规则的)上面摆放棋子,棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列,请编程求解对于给定形状和大小的棋盘,摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数,n k,用一个空格隔开,表示了将在一个n*n的矩阵内描述棋盘,以及摆放棋子的数目。 n <= 8 , k <...原创 2018-04-02 20:48:01 · 273 阅读 · 0 评论 -
最长回文子串
#include<bits/stdc++.h>#include<iostream>#include<string>#include<cstdio>using namespace std;int dp[1500][1500];//string s1,s2;int main(void){ int i,j,len ; while(ci...原创 2018-03-29 16:39:59 · 85 阅读 · 0 评论 -
D - Covering HDU - 6185 (杜教板子(BM)线性递推式)
D - CoveringHDU - 6185Bob's school has a big playground, boys and girls always play games here after school.To protect boys and girls from getting hurt when playing happily on the playground, ...原创 2019-03-10 14:30:35 · 253 阅读 · 0 评论