Advertisement
a53

selectare

a53
Feb 9th, 2021
105
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.59 KB | None | 0 0
  1. #include <fstream>
  2.  
  3. using namespace std;
  4. int f[1000000];
  5. int v[10001];
  6. int N, L, K, i, j, i1, i2, t, s, e, val;
  7. int main () {
  8. ifstream fin ("selectare.in");
  9. ofstream fout("selectare.out");
  10. fin>>N>>L>>K;
  11. for (i=1;i<=N;i++)
  12. fin>>v[i];
  13.  
  14. for (s = L-K; s <= L; s++) {
  15. for (i=1;i+s-1<=N;i++) {
  16. /// consideram secventa care incepe la pozitia i si se termina
  17. /// la pozitia i+s-1
  18. /// si din care eliminam s-(L-K) elemente
  19. j = i+s-1;
  20. e = s-(L-K);
  21. if (e == 0) {
  22. val = 0;
  23. for (t=i;t<=j;t++)
  24. val = val*10+v[t];
  25. f[val]++;
  26. }
  27. if (e == 1) {
  28. for (i1=i+1;i1<=j-1;i1++) {
  29. val = 0;
  30. for (t=i;t<=j;t++)
  31. if (t!=i1)
  32. val = val*10 + v[t];
  33. f[val]++;
  34. }
  35. }
  36. if (e == 2) {
  37. for (i1=i+1;i1<j-1;i1++)
  38. for (i2=i1+1;i2<j;i2++) {
  39. val = 0;
  40. for (t=i;t<=j;t++)
  41. if (t!=i1 && t!=i2)
  42. val = val * 10 + v[t];
  43. f[val]++;
  44. }
  45. }
  46. }
  47.  
  48. }
  49. int p = 1, sol, maxim = 0;
  50. for (i=1;i<=L;i++)
  51. p = p*10;
  52. for (i=0;i<p;i++)
  53. if (f[i] > maxim) {
  54. maxim = f[i];
  55. sol = i;
  56. }
  57. fout<<sol;
  58. return 0;
  59. }
  60.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement