摘要：
初步找大概位置，然后找精确位置，算是简单化的分块吧！ #include<cstdio> #include<cstdlib> #include<iostream> using namespace std; int c[5000]; int num=0; void _get() { int k=1,m; 阅读全文
摘要：
题目：一个由‘.’和‘#’组成矩形，统计里面'.'组成的矩形的个数。 点击打开链接 自己写挂了，懒得搞了 阅读全文
摘要：
Zoj1654 标准解法：二分匈牙利。 写法各异嘛，看不懂或者懒得看也正常，如果想了解我思路的可以和我讨论的。 在练习sap，所以还是写了一遍： 阅读全文
摘要：
A war had broken out because a sheep from your kingdom ate some grasses which belong to your neighboring kingdom. The counselor of your kingdom had to 阅读全文
摘要：
代码先寄放这里 #include #include #include #include #include #include using namespace std; int n,m,T=0; mapMap; void _update() { Map.clear(); } void _init1() { string s; for(int i=1;i>s; ... 阅读全文
摘要：
Alice bought a lot of pairs of socks yesterday. But when she went home, she found that she has lost one of them. Each sock has a name which contains e 阅读全文
摘要：
FatMouse's SpeedTime Limit: 2 Seconds Memory Limit:65536 KB Special Judge FatMouse believes that the fatter a mouse is, the faster it runs. To disprov 阅读全文
摘要：
A common typing error is to place the hands on the keyboard one row to the right of the correct position. So "Q" is typed as "W" and "J" is typed as " 阅读全文
摘要：
Given any integer 0 <= n <= 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many dig 阅读全文
摘要：
Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expr 阅读全文