ques
CodeChef: Practical coding for everyone
my soln
/* YATIN KWATRA */
#include <bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
using namespace std;
int main() {
int t;
cin >> t;
while(t--)
{
int n,d;
cin >> n >> d;
map<string,bool>h;
string s[n];
int left[n];
int maxans = 0;
for(int i = 0 ; i < n ; i++)
{
cin >> s[i];
if(i==0)
{
left[i] = 1;
}
else{
if(!h.count(s[i])) left[i] = left[i-1]+1;
else left[i] = left[i-1];
}
if(!h.count(s[i])) h[s[i]] = true;
if(left[i] > maxans) maxans = left[i];
// cout << left[i] << " ";
}
if(maxans > d) cout << d << endl;
else cout << maxans << endl;
}
return 0;
}
what am i missing in this question ?