PAT 1129. Recommendation System (25) 数数
来源:互联网 发布:长沙黑马程序员 编辑:程序博客网 时间:2024/05/22 15:16
1129. Recommendation System (25)
Recommendation system predicts the preference that a user would give to an item. Now you are asked to program a very simple recommendation system that rates the user's preference by the number of times that an item has been accessed by this user.
Input Specification:
Each input file contains one test case. For each test case, the first line contains two positive integers: N (<= 50000), the total number of queries, and K (<= 10), the maximum number of recommendations the system must show to the user. Then given in the second line are the indices of items that the user is accessing -- for the sake of simplicity, all the items are indexed from 1 to N. All the numbers in a line are separated by a space.
Output Specification:
For each case, process the queries one by one. Output the recommendations for each query in a line in the format:
query: rec[1] rec[2] ... rec[K]
where query is the item that the user is accessing, and rec[i] (i = 1, ... K) is the i-th item that the system recommends to the user. The first K items that have been accessed most frequently are supposed to be recommended in non-increasing order of their frequencies. If there is a tie, the items will be ordered by their indices in increasing order.
Note: there is no output for the first item since it is impossible to give any recommendation at the time. It is guaranteed to have the output for at least one query.
Sample Input:12 33 5 7 5 5 3 2 1 8 3 8 12Sample Output:
5: 37: 3 55: 3 5 75: 5 3 73: 5 3 72: 5 3 71: 5 3 28: 5 3 13: 5 3 18: 3 5 112: 3 5 8
#include <iostream>#include<stdio.h>#include<queue>#include<algorithm>#include<vector>#include<string>#include<string.h>#include<set>#include<deque>#include<queue>using namespace std;struct ZZ{ int value; int cnt;};int mark[50005]={0};ZZ maxx[15];int last;void goin(int x,int k){ mark[last]++; int p=0; while(p<k) { if(mark[last]>maxx[p].cnt||(mark[last]==maxx[p].cnt&&last<maxx[p].value) ) { break; //找到新数字该插入的位置 } p++; } if(p<k) { int pp=p; //找找后面有没有他自己 while(pp<k&&maxx[pp].value!=last) pp++; for(int i=pp-1;i>=p;i--) { maxx[i+1]=maxx[i]; } maxx[p].value=last; maxx[p].cnt=mark[last]; } printf("%d:",x); for(int i=0;i<k;i++) { if(maxx[i].value==-1) break; printf(" %d",maxx[i].value); } last=x; cout<<endl;}int main(){ int n,k; for(int i=0;i<15;i++) { maxx[i].cnt=-1; maxx[i].value=-1; } cin>>n>>k; int tmp; cin>>tmp; last=tmp; for(int i=1;i<n;i++) { scanf("%d",&tmp); goin(tmp,k); } return 0;}
- PAT 1129. Recommendation System (25) 数数
- PAT 1129. Recommendation System (25)
- PAT--1129. Recommendation System
- PAT甲级 1129. Recommendation System (25)
- 【PAT】【Advanced Level】1129. Recommendation System (25)
- PAT 甲级 1129. Recommendation System (25)
- PAT(A)-1129. Recommendation System (25)(优先队列)
- pat 1129. Recommendation System (25)(set的增删)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- 1129. Recommendation System (25)
- PAT 1129Recommendation System
- 1129. Recommendation System (25) set
- PAT 1129. Recommendation System (25) 优先队列--维持前k个最大堆
- FileZilla远端登录虚拟机Linux
- FastJSON将String转为Bean文件(可用于Activity间的Bean文件传递)
- 关于用MyEclipse6.6,jdk1.8,class不编译的问题
- kotlin 中的枚举类和 “when”
- 宽度固定高度按原图比例适应的ImageView
- PAT 1129. Recommendation System (25) 数数
- Test
- LeetCode-37-Sudoku Solver, list转字符串join,回溯
- 第一章 编译程序概述
- 【不想活了】DELPHI 运行程序出现System Error. Code: 5. 拒绝访问。
- Ubuntu 下实现FTP服务器,SSH服务器,邮件服务器,Web服务器(四)
- 欢迎使用CSDN-markdown编辑器
- MySQL索引背后的数据结构及算法原理
- hdu 1069 Humble Numbers LCS变种