fork download 
  1. import java.io.*;
  2. import java.util.ArrayList;
  3.  
  4. class Solution {
  5.     public static void main(String[] args) throws Exception {
  6. 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  7. 		char c;
  8. 		int n;
  9. 		boolean flag = true;
  10.  
  11. 		String s = "";
  12. 		while (true) {
  13. 			c = (char) br.read();
  14. 			if (c == '\n'||c==-1)
  15. 				break;
  16. 			if (Character.isAlphabetic(c) || c == ' ')
  17. 				s += c;
  18. 		}
  19. 		String[] str = s.split(" ");
  20. 		String[] t = s.toLowerCase().split(" ");
  21. 		n = Integer.parseInt(br.readLine());
  22. 		ArrayList<String> l = new ArrayList<String>();
  23.  int u;
  24. 		for (int j = 0; j < n; j++)
  25. 		{
  26. 			String s1 = "";
  27. 			while (true) {
  28.                              u= br.read();
  29. 				c = (char)u;
  30. 				if (c == '\n'||u==-1)
  31. 					break;
  32. 				if (Character.isAlphabetic(c))
  33. 					s1 += c;
  34. 			}
  35.                    // System.out.println(s1);
  36.                                                              if(!l.contains(s1.toLowerCase()))
  37. 			l.add(s1.toLowerCase());
  38. 		}
  39. 		int i = 0;
  40. 		int siz = t.length;
  41. 		int b = 0, e = siz - 1, x = siz, y = 0;
  42. 		ArrayList<String> dup = new ArrayList<String>();
  43. 		while (i < siz) {
  44.  
  45. 			if (l.contains(t[i])) {
  46.  
  47. 				if (x > i)
  48. 					x = i;
  49. 				if (!dup.contains(t[i])) {
  50. 					dup.add(t[i]);
  51.  
  52. 					if (dup.size() == l.size()) {
  53.  
  54. 						flag = false;
  55. 						if ((i - x) < (e - b)) {
  56.  
  57. 							b = x;
  58. 							e = i;
  59. 						}
  60. 						dup.removeAll(dup);
  61.  
  62. 						i = x;
  63. 						x = i + 2;
  64. 					}
  65. 				} else {
  66. 					// System.out.println("$$"+i);
  67. 					x = i;
  68. 					dup.removeAll(dup);
  69.  
  70. 					dup.add(t[i]);
  71. 				}
  72.  
  73. 			}
  74.  
  75. 			i++;
  76.  
  77. 		}
  78.  
  79. 		if (flag)
  80. 			System.out.println("NO SUBSEGMENT FOUND");
  81. 		else {
  82. 			for (int w = b; w <= e; w++) {
  83. 				System.out.print(str[w] + " ");
  84. 			}
  85. 		}
  86.  
  87. 	}
  88. }
Success #stdin #stdout 0.22s 57804KB
comments (?)
stdin 
x x a x a x b x b x c x a x x x x b xx b c xb c x cbxc x a x  b a x c z a  X C B CXZ A  Q ZA X X A  XC  x c as  c v b c as a c v  b vc  c c  sa a  as  c c vb b fg f d  sdxc x c v b  cx a   x c v b cx  a x c vc v bv b v c c x a  a s d c x cvv bb v  c x a qa  z x c v b c x z a q a z x c v f cd x s x x  c v c  cdf d x x c v  c xc x s a  a s d fd  fgg  v c c x x z as 
3
a
c
b
stdout 
C B CXZ A
https://ideone.com/54eWag
language:
Java (HotSpot 12)
created:
6 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!