532. Building Foundation 题目连接: http://acm.sgu.ru/problem.php?contest=0&problem=532 Description A new office building is to appear in Berland soon. Its construction has just been started, and the first problem builders are facing is to lay the foundat…

NEERC Southern Subregional 2011 A - Bonnie and Clyde solution 双指针搞搞就好. 时间复杂度:\(O(n)\) B - Building Foundation 题目描述:给定\(n\)条线段(水平或垂直),问能构成多少个矩形(只要矩形的四条边都被线段覆盖即可),水平线段不相交,垂直线段不相交. solution 预处理出每条垂直的线段与哪些水平的线段相交,然后枚举两条垂直的线段,数一下有多少公共的水平线段\(s\),答案增加\(C_s^…

Template Method is a behavioral design pattern and it’s used to create a method stub and deferring some of the steps of implementation to the subclasses.Template method defines the steps to execute an algorithm and it can provide default implementati…

Complete Building the Houses Time Limit: 20 Sec  Memory Limit: 256 MB 题目连接 http://acm.uestc.edu.cn/#/problem/show/3 Description Bear has a large, empty ground for him to build a home. He decides to build a row of houses, one after another, say n in t…

Description Once upon a time Matt went to a small town. The town was so small and narrow that he can regard the town as a pivot. There were some skyscrapers in the town, each located at position x i with its height h i. All skyscrapers located in dif…

<传送门> 128. Snake time limit per test: 0.25 sec. memory limit per test: 4096 KB There are N points given by their coordinates on a plane. All coordinates (xi,yi) are integers in a range from -10000 up to 10000 inclusive . It is necessary to construct…

142. Keyword time limit per test: 0.5 sec. memory limit per test: 16384 KB Kevin has invented a new algorithm to crypt and decrypt messages, which he thinks is unbeatable. The algorithm uses a very large key-string, out of which a keyword is found ou…

Building OpenCascade on Windows with Visual Studio eryar@163.com 摘要Abstract:详细说明OpenCascade的编译配置过程,希望对你编译OpenCascacde有所帮助.本文内容来自OCCT的Overview文档,详细信息可参考之. 关键字Key Words:OpenCascade.Compiling 一.源码包 Source package OpenCascade的源码包中包括OpenCascade的源代码.示例程序源代…

UVa 129 Krypton Factor 注意输出格式,比较坑爹. 每次要进行处理去掉容易的串,统计困难串的个数. #include<iostream> #include<vector> #include<cmath> #include<map> #include<algorithm> #include<cstring> #include<cstdio> #include<cstdlib> #include…

题目地址:http://acm.sgu.ru/problem.php?contest=0&problem=107 /* 题意:n位数的平方的后面几位为987654321的个数 尼玛,我看描述这一句话都看了半天,其实只要先暴力程序测试一边就知道规律 详细解释:http://www.cnblogs.com/Rinyo/archive/2012/12/04/2802089.html */ #include <cstdio> #include <iostream> #include…