STL
Roly_Yu
快码佳编
展开
-
Let the Balloon Rise(1004)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1004 #include#include#include#includeusing namespace std;int main(){ int n; string str; while(cin>>n&&n){ mapstring,原创 2014-03-13 14:12:04 · 458 阅读 · 0 评论 -
hoj 1999
http://acm.hit.edu.cn/hoj/problem/view?id=1999#include#include#include#include#includeusing namespace std;string str;priority_queueint> q;int main(){ cin.sync_with_stdio(fals原创 2014-03-13 14:15:05 · 419 阅读 · 0 评论 -
九度OJ题目1554:区间问题
/* 判断如果k比连续子数组和的最大值还大,比最小值还小,那么肯定无解了,直接输出No */#include #include using namespace std;const int maxn = 10005;int a[maxn];int b[maxn];int main(){ int n; while(~scanf("%d",&n)){原创 2014-04-17 11:15:53 · 1292 阅读 · 0 评论 -
Light OJ 1014 - Ifter Party
思路:先求P-L的因子原创 2014-04-28 15:12:53 · 482 阅读 · 0 评论 -
The kth great number
The kth great numberTime Limit : 2000/1000ms (Java/Other) Memory Limit :65768/65768K (Java/Other)Total Submission(s) : 26 Accepted Submission(s) : 9Problem DescriptionXiao Ming and Xiao Bao are p原创 2014-03-13 14:12:28 · 627 阅读 · 0 评论 -
POJ(2431)Expedition
#include #include #include #include #include #include #include using namespace std;const int maxn = 10005;struct stop{ int d,f; friend bool operator<(const stop &a,const stop &b){原创 2014-09-03 19:37:11 · 380 阅读 · 0 评论