ACM_STL
文章平均质量分 61
小白菜小青菜
平凡的脚步也可以走出伟大的行程!
展开
-
杭电 1037 Online Judge 字符处理
Online JudgeIgnatius is building an Online Judge, now he has worked out all the problems except the Judge System. The system has to read data from correct output file and user’s result file, then the s原创 2017-04-13 09:51:26 · 394 阅读 · 0 评论 -
POJ 1028 Web Navigation(stack+字符串处理)
Web NavigationDescription Standard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track o原创 2017-12-02 16:14:32 · 181 阅读 · 0 评论 -
HDU 1251 统计难题(字典树,map)
统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 42826 Accepted Submission(s): 15388Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写原创 2017-08-04 10:29:50 · 239 阅读 · 0 评论 -
HDU 3449 Consumer(有依赖背包)
Consumer Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/65536 K (Java/Others) Total Submission(s): 2385 Accepted Submission(s): 1269Problem Description FJ is going to do some shoppin原创 2017-11-18 21:27:43 · 234 阅读 · 0 评论 -
UVa 11988 破损的键盘 链表 双向队列
链表解决 用数组频繁的移动元素效率较低,用链表 较好。#include<iostream> #include<cstdio> #include<cstring> using namespace std; int next[100005]; char s[100005]; int main() { int last,cur; //freopen("shujia.txt","r",st原创 2017-07-09 09:32:31 · 293 阅读 · 0 评论 -
逃出迷宫 优先队列
逃出迷宫时间限制: 1 Sec 内存限制: 128 MB 提交: 24 解决: 12题目描述 现在有一个迷宫,’a’代表起点位置,’.’代表可以通行的路,’#’代表不能通过的墙,’x’代表迷宫的守卫,’r’代表终点位置, 现在要求你算出起点位置到终点位置的最短时间,其中通过’.’时,消耗1个单位时间,通过’x’消耗两个单位时间。 输入 多组测试数据,输入两个整数(X,Y)代表迷宫的长和原创 2017-04-10 10:06:25 · 347 阅读 · 0 评论 -
杭电 字符串处理 map
Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn’t know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves原创 2017-04-11 10:02:58 · 387 阅读 · 0 评论 -
字典字符串
In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the answer it is nec原创 2017-04-11 16:25:27 · 398 阅读 · 0 评论 -
杭电1896 queue 优先队列
Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time. Th原创 2017-04-12 14:37:42 · 274 阅读 · 0 评论 -
杭电 oj 3350 #define is unsafe
#define is unsafeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 568 Accepted Submission(s): 359Problem Description Have you used #define i原创 2017-05-01 21:05:08 · 345 阅读 · 0 评论 -
计算表达式 栈
读入一个只包含 +, -, *, / 的非负整数计算表达式,计算该表达式的值。Input 测试输入包含若干测试用例,每个测试用例占一行,每行不超过200个字符,整数和运算符之间用一个空格分隔。没有非法表达式。当一行中只有0时输入结束,相应的结果不要输出。Output 对每个测试用例输出1行,即该表达式的值,精确到小数点后2位。Sample Input 1 + 2 4 + 2 * 5 - 7原创 2017-04-11 23:40:07 · 428 阅读 · 0 评论 -
杭电 1088 字符处理
Problem Description If you ever tried to read a html document on a Macintosh, you know how hard it is if no Netscape is installed. Now, who can forget to install a HTML browser? This is very easy be原创 2017-04-12 15:29:06 · 391 阅读 · 0 评论 -
L2-005. 集合相似度(set)
L2-005. 集合相似度 给定两个整数集合,它们的相似度定义为:Nc/Nt*100%。其中Nc是两个集合都有的不相等整数的个数,Nt是两个集合一共有的不相等整数的个数。你的任务就是计算任意一对给定集合的相似度。 输入格式: 输入第一行给出一个正整数N(<=50),是集合的个数。随后N行,每行对应一个集合。每个集合首先给出一个正整数M(<=104),是集合中元素的个数;然后跟M个...原创 2018-03-28 20:59:50 · 145 阅读 · 0 评论