제출 #743666

#제출 시각아이디문제언어결과실행 시간메모리
743666vjudge1Rima (COCI17_rima)C++17
28 / 140
189 ms18588 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 2e5 + 5, M = 1e6 + 6, mod = 998244353; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; vector<string> v(n); for (int i = 0; i < n; ++i) { cin >> v[i]; reverse(v[i].begin(), v[i].end()); } sort(v.begin(), v.end()); int cnt = 1, ans = 1; for (int i = 1; i < n; ++i) { if (abs(int(v[i].size()) - int(v[i - 1].size())) <= 1){ int mx = max(int(v[i].size()) , int(v[i - 1].size())); if(v[i].substr(0,mx-1) == v[i-1].substr(0,mx-1)){ cnt++; } else cnt = 1; } else cnt = 1; ans = max(ans,cnt); } cout << ans << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...