POJ 2643 Election 第一次写博客,想通过写博客记录自己的ACM历程,也想解释下英文题目,写些自己的理解.也可以让自己以后找题目更加方便点嘛.ElectionTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 4491 Accepted: 2100 Description Canada has a multi-party system of government. Each candidate is generall…

Election Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 3558   Accepted: 1692 Description Canada has a multi-party system of government. Each candidate is generally associated with a party, and the party whose candidates win the most ri…

题目链接:http://poj.org/bbs?problem_id=2503 思路分析: 题目数据数据量为10^5, 为查找问题,使用Hash或Map等查找树可以解决,也可以使用字典树查找. 代码(Map实现): #include <iostream> #include <sstream> #include <string> #include <map> using namespace std; int main() { ], foreignWord[],…

http://poj.org/problem?id=2296 题意:题意:给你n个点,每个点上都放一个正方形,点只能在正方形的上边或下边的中点上,所有正方形大小一样,不能有面积重叠,求最大的正方形.(n<=100) #include <cstdio> #include <cstring> #include <algorithm> #include <cmath> #include <iostream> using namespace std…

题意:可以把n边为n+1,n-1,n*2问从n到k的最少变化次数. 坑:标题写了.有点不会写bfs了... ac代码 #define _CRT_SECURE_NO_WARNINGS #include<cstring> #include<cctype> #include<cstdlib> #include<cmath> #include<cstdio> #include<string> #include<stack> #in…

Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Some…

一.Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them. Input Input consists of up to 100,000 dictionary e…

487-3279 Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 287874   Accepted: 51669 Description Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phras…

#include<iostream> #include<stdio.h> #include<string> #include<algorithm> #define MAXN 21 using namespace std; struct cand_man { int num; string name; string party; }; int compare(const void * i,const void * j); cand_man man[MAXN];…

这道题网上非常多人都会说easy,水题之类的话,只是我看了下说这种话的人的程序,能够说他们的程序都不及格! 为什么呢?由于他们的程序都是使用简单的二次排序水过(大概你能搜索到的多是这种程序).那样自然能够说不及格了. 由于本题真正的目的是求前k个最大数的问题.这就须要活用高速排序. 求前k个最大数的思路: 1 选取一个数位轴,然后把大于这个数的数放到数列前面.小于这个数的数放到数列后面 2 假设前面的数的数量大于k.那么能够去掉后面的数,递归在前面的数查找前k个最大数 3 假设前面的数的数量小于…