hiho一下 第六十二周题目1 : Browser Caching
发布日期:2021-11-22 02:48:45 浏览次数:2 分类:技术文章

本文共 2365 字,大约阅读时间需要 7 分钟。

题目1 : Browser Caching

时间限制:
10000ms
单点时限:
1000ms
内存限制:
256MB

描述

When you browse the Internet, browser usually caches some documents to reduce the time cost of fetching them from remote servers. Let's consider a simplified caching problem. Assume the size of browser's cache can store M pages. When user visits some URL, browser will search it in the cache first. If the page is already cached browser will fetch it from the cache, otherwise browser will fetch it from the Internet and store it in the cache. When the cache is full and browser need to store a new page, the least recently visited page will be discarded.

Now, given a user's browsing history please tell us where did browser fetch the pages, from the cache or the Internet? At the beginning browser's cache is empty.

输入

Line 1: Two integers N(1 <= N <= 20000) and M(1 <= M <= 5000). N is the number of pages visited and M is the cache size.

Line 2~N+1: Each line contains a string consisting of no more than 30 lower letters, digits and dots('.') which is the URL of the page. Different URLs always lead to different pages. For example www.bing.com and bing.com are considered as different pages by browser.

输出

Line 1~N: For each URL in the input, output "Cache" or "Internet".

提示

Pages in the cache before visiting 1st URL [null, null]

Pages in the cache before visiting 2nd URL [www.bing.com(1), null]

Pages in the cache before visiting 3rd URL [www.bing.com(1), www.microsoft.com(2)]

Pages in the cache before visiting 4th URL [www.bing.com(1), www.microsoft.com(3)]

Pages in the cache before visiting 5th URL [windows.microsoft.com(4), www.microsoft.com(3)]

The number in parentheses is the last visiting timestamp of the page.

样例输入
5 2www.bing.comwww.microsoft.comwww.microsoft.comwindows.microsoft.comwww.bing.com
样例输出
InternetInternetCacheInternetInternet
题解:输入n个网站,浏览器的缓存为m,如果缓存中有网站,将前一个网站移除,将网站添加到最后,输出cache,不存在internet,判断是否超出缓存大小,如果超过将最近为访问的网站移除。
ACcode:
import java.util.ArrayList;import java.util.List;import java.util.Scanner;public class Main {		public static void main(String[] args) {				Scanner scanner = new Scanner(System.in);		List
list = new ArrayList
(); int n = scanner.nextInt(); int m = scanner.nextInt(); for(int i=0; i
=m){ list.remove(0); list.add(str); }else{ list.add(str); } } } }}

转载地址:https://blog.csdn.net/zxdfc/article/details/48250887 如侵犯您的版权,请留言回复原文章的地址,我们会给您删除此文章,给您带来不便请您谅解!

上一篇:[LeetCode]Unique Paths
下一篇:hiberante4连接oracle数据库入门

发表评论

最新留言

表示我来过!
[***.240.166.169]2024年04月17日 03时27分10秒