import java.io.*;
import java.util.*;public class Main {public static void main(String[] args) throws IOException {BufferedReader br = new BufferedReader(new InputStreamReader(System.in));int n = Integer.adLine().trim()); //读取用户个数String[] str = br.readLine().trim().split(" ");//读取每个用户的喜好度Map<Integer,List<Integer>> userLike = new HashMap<>();for (int i = 0; i < n; ++i) {int key = Integer.parseInt(str[i]);if (!ainsKey(key)) {List<Integer> list = new ArrayList<>();list.add(i);userLike.put(key,list);}else {(key).add(i);}}int q = Integer.adLine().trim());//读取查询组数for (int j = 0; j < q; ++j){String[] s = br.readLine().trim().split(" ");int l = Integer.parseInt(s[0]);int r = Integer.parseInt(s[1]);int k = Integer.parseInt(s[2]);int count = 0;List<Integer> list = (k);if (list != null) {for (Integer i : list){if (i >= l-1 && i <= r-1) {++count;}}}System.out.println(count);}}
}
import java.io.*;
import java.util.*;public class Main {public static void main(String[] args) throws IOException {BufferedReader br = new BufferedReader(new InputStreamReader(System.in));String[] str = br.readLine().trim().split(" ");int n = Integer.parseInt(str[0]); //珠子的个数int m = Integer.parseInt(str[1]);//连续m个珠子int c = Integer.parseInt(str[2]);//颜色种类Map<Integer,List<Integer>> map = new HashMap<>();// key:颜色, value:包含这种颜色的珠子for (int i = 0; i < n; ++i) {String[] s = br.readLine().trim().split(" ");int num_i = Integer.parseInt(s[0]);for (int j = 1; j <= num_i; ++j) {int key = Integer.parseInt(s[j]); if (!ainsKey(key)) {List<Integer> list = new ArrayList<>();list.add(i);map.put(key,list);}else {(key).add(i);}}}int count = 0;for(List<Integer> list : map.values()){for(int j=0; j<list.size();j++) {if (j+1<list.size() && (j+1)- (j)<m){count++;break;}else if(j+1 == list.size() && (0)(j)<m){count++;break;}}}System.out.println(count);}
}
import java.io.*;
import java.util.*;public class Main {public static void main(String[] args) throws IOException {BufferedReader br = new BufferedReader(new InputStreamReader(System.in));String[] str = br.readLine().trim().split(" ");String s = str[0];int m = Integer.parseInt(str[1]);int ans = 1;for(char c = 'a' ; c<='z' ; c++){int[] pos = new int[s.length()];//存储字符串中当前字符出现的位置int cnt = 0;for(int i = 0 ; i<s.length();i++){if(s.charAt(i) == c){pos[cnt] = i;cnt++;}}//只有一个字符,最多为1次if(cnt<2)continue;int[][] dp = new int[cnt][cnt];int tem = 1;for(int len = 2 ;len<=cnt;len++){for(int i = 0 ;i+len-1<cnt;i++){dp[i][i+len-1] = dp[i+1][i+len-2] + pos[i+len-1] - pos[i] + 1 - len;if(dp[i][i+len-1]<=m)tem = len;}}ans = Math.max(ans,tem);}System.out.println(ans);}
}
本文发布于:2024-02-05 01:06:30,感谢您对本站的认可!
本文链接:https://www.4u4v.net/it/170720570861663.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
留言与评论(共有 0 条评论) |