- 博客(24)
- 资源 (6)
- 收藏
- 关注
原创 折半枚举+3SUM--poj2549
3SUMSuppose the input array is . 3SUM can be solved in time by inserting each number into a hash table, and then for each index and, checking whether the hash table contains the integer.
2013-11-29 13:13:07 628
原创 折半枚举--poj3977
Language:DefaultSubsetTime Limit: 30000MS Memory Limit: 65536KTotal Submissions: 1136 Accepted: 190DescriptionGiven a list of N integers with absolute val
2013-11-28 22:05:41 1129
原创 反转问题--poj1222
Language:DefaultEXTENDED LIGHTS OUTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5867 Accepted: 3870DescriptionIn an extended version of the g
2013-11-28 15:35:52 531
原创 反转--poj3185
The Water BowlsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3958 Accepted: 1554DescriptionThe cows have a line of 20 water bowls from which they drink.
2013-11-28 14:32:29 612
原创 开关问题-poj3276
Language:DefaultFace The Right WayTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 1983 Accepted: 939DescriptionFarmer John has arranged his N (1
2013-11-26 21:08:08 689
原创 尺取--poj2739
Language:DefaultSum of Consecutive Prime NumbersTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17200 Accepted: 9464DescriptionSome positive int
2013-11-26 14:04:23 597
原创 尺取(很不错的题)--poj2566
题意:给你一段序列,让你判断跟某个数最近的区间。二分应该也可以做#include#include#include#includeusing namespace std;const int maxn=100005;const int INF=INT_MAX;int n,m;pairp[maxn];inline int fab(int x){return x>0?x:-x
2013-11-25 22:16:29 833
原创 再谈string
c++中的string跟java中的不一样,java中string是不可变的,而c++中的string是可变的!下面例子仅供参考:#include#include#includeusing namespace std;int main(){ string a("dcba"),b("eof"),c; int num=a.size(); sort(a.be
2013-11-24 22:40:11 547
原创 推公式+二分--poj1759
公式:Hn=(n-1)*H2+(n-2)*(n-1)-(n-2)*H1代码如下:#include#includeusing namespace std;const double eps=1e-8;int N;double A;double cal(double mid,int n){ return (n-1)*mid+(n-2)*(n-1)-(n-2)*A;}bo
2013-11-24 13:36:59 653
原创 二分+SPFA--poj3662
Language:DefaultTelephone LinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4397 Accepted: 1607DescriptionFarmer John wants to set up a tel
2013-11-23 21:57:23 1053
原创 facebook
很简单的一个题,结果做错了,细节。。。。题意:给你N*N个网格,让您判断所有的#是否做成正方形。#include#include#includeusing namespace std;int N;char a[30][30];int vis[30][30];int main(){ //freopen("in.txt","r",stdin); //freope
2013-11-23 20:18:25 605
原创 二分使第K个数尽量大--poj2010
Language:DefaultMoo University - Financial AidTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 3892 Accepted: 1159DescriptionBessie noted that al
2013-11-22 22:57:53 818
原创 两次二分搜索--poj3685
Language:DefaultMatrixTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 4312 Accepted: 1063DescriptionGiven a N × N matrix A, whose element in the
2013-11-21 12:43:27 827
原创 二分搜索(两次)-poj3579
Language:DefaultMedianTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3418 Accepted: 944DescriptionGiven N numbers, X1, X2, ... , XN, let us c
2013-11-21 11:08:23 1931
原创 二分
Language:DefaultK BestTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 4894 Accepted: 1331Case Time Limit: 2000MS Special JudgeDescription
2013-11-19 20:51:47 972
原创 01分数规划+二分搜索
Language:DefaultDropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5119 Accepted: 1770DescriptionIn a certain course, you take n test
2013-11-19 15:31:19 920
原创 简单dp
Language:DefaultApple CatchingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6687 Accepted: 3253DescriptionIt is a little known fact that cows
2013-11-19 15:27:15 843
原创 dp
Problem Description话说在qtech有一个ACM集训室,它就在主教学楼A423,Qtech的ACMer平时就是聚在这个教室里面刷题。这个教室里面鱼龙混杂,有大一的、大二的、大三的,当然还有大四的(比如我这个菜鸟)。我们遇到问题就会相互讨论,集训室里的学习氛围非常浓厚,当然我们偶尔也会放松一下,锻炼一下身体,比如。。。。打乒乓球!我们自己创造了一种乒乓球的新玩法,下面就让我介绍
2013-11-19 13:03:54 798
原创 快速排序
#include using namespace std;int a[100],n,temp;void QuickSort(int *a,int l,int r){ if(l<r) { int s=a[l]; int i=l,j=r+1; while(1) { while(i+1<n&&
2013-11-14 22:21:39 433
原创 后缀数组-倍增发(模板)
//后缀数组,倍增法实现int n,k;int rank[MAX],tmp[MAX];bool compare_sa(int i,int j){ if(rank[i]!=rank[j]) return rank[i]<rank[j]; int ri=i+k<=n?rank[i+k]:-1; int rj=j+k<=n?rank[j+k]:-1;
2013-11-13 21:16:23 750
原创 次小生成树--poj11679
Language:DefaultThe Unique MSTTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18336 Accepted: 6378DescriptionGiven a connected undirected graph,
2013-11-12 21:51:55 496
原创 字符串hash(二维)-poj3690
Language:DefaultConstellationsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 4758 Accepted: 904DescriptionThe starry sky in the summer night
2013-11-11 13:48:32 737
原创 置换群
高端的置换群。题意:手镯翻转之后看做相同,相连看做不同,两者旋转之后都看做相同,问给定颜色数和珠子数可以做多少种不同的手镯或相连。思路:贝恩赛德定理,等价类计数。#include#include#include#include#include#include#include#include#include#include#includetypedef long
2013-11-07 21:15:50 589
原创 01分数规划【最优比率环】--poj3621
01分数规划,又称参数搜索。即求形如(∑Di*xi)/(∑Ci*xi)的最值问题,其中xi={0,1}即只有取或不取2种状态。设最值为ans则必有∑(Di-ans*Ci)*xi=0,且因为Di和Ci都是给定的,当xi确定时,等式左边可以看成是一个以ans为变量的单调函数。因此求最优解转化为求解方程跟的问题。此题是对01分数规划的应用,那么首先明白01分数规划的思想.01分数规划的思想的描述
2013-11-01 20:00:22 834
高效awk编程
2018-06-03
hadoop-eclipse-plugin-2.7.2.jar
2016-03-19
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人