摘要: 1.Long Inversions void solve(){ int n; cin >> n; string s; cin >> s; s = ' '+s; int ans = 1; for(int k=n; k>=2; k--){ vector<int> dif(n+k+1, 0); for(i 阅读全文
posted @ 2025-03-04 09:11 Devpp 阅读(12) 评论(0) 推荐(0)