(Relax ST1.20)POJ 3663 Costume Party(贪心+剪枝)
2013-11-28 20:56
344 查看
解题报告:这道题就是让求两牛之间的距离小于等于s的个数,直接遍历找的话TLE,先利用快排从小到大排序, 再遍历同时缩小遍历的范围;
/* * POJ_3663.cpp * * Created on: 2013年11月26日 * Author: Administrator */ #include <iostream> #include <cstdio> #include <algorithm> using namespace std; const int maxn = 20005; int a[maxn]; int main(){ int n,s; while(scanf("%d%d",&n,&s)!=EOF){ int i; for(i = 0 ; i < n ; ++i){ scanf("%d",&a[i]); } sort(a,a+n); int count = 0; int j; for(i = 0 ; i < n-1 ; ++i){ if(a[i] > s){//剪枝,不剪枝的话会TLE break; } for(j = i+1 ; j < n ; ++j){ if(a[i] + a[j] <= s){ count++; } } } printf("%d\n",count); } return 0; }
相关文章推荐
- Costume Party POJ - 3663
- poj 3663 Costume Party
- POJ 3663 costume party
- POJ 3663:Costume Party
- POJ 3663 Costume Party (快速排序)
- POJ 3663:Costume Party
- POJ 3663 Costume Party (二分查找)
- POJ-3663-Costume Party
- POJ 3663 Costume Party (二分查找)
- poj 3663 Costume Party(快排)
- Poj-3663-Costume Party-双指针扫描
- (Relax ST1.19)POJ 3627 Bookshelf(贪心)
- poj 3663 Costume Party
- poj 3663 Costume Party 【简单搜索】
- G - Costume Party POJ - 3663
- POJ 3663 Costume Party
- POJ 3663 Costume Party(模拟+减枝)
- (Relax ST1.11)POJ 2159 Ancient Cipher(判断一个字符串是否是另外一个字符串的原串)
- (Relax ST1.6)POJ 1218 THE DRUNK JAILER(求1-n之间有多少个平方数)
- (Relax 贪心1.7)POJ 2393 Yogurt factory(求囤积货物的最小代价)