提出 #68378696

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef tuple<int, int, int> ti;
typedef vector<bool> vb;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> OS;
//FOR BLITZ READING INPUT/OUTPUT TEXT FILES
//ifstream fin("input.txt");
//ofstream fout("output.txt");

void solve() {
    string s;
    cin >> s;
    vi idxs;
    for (int i = 0; i < sz(s); i++) {
        if (s[i] == 't') idxs.push_back(i);
    }
    if (sz(idxs) < 3) cout << 0 << endl;
    else {
        double ans = 0;
        for (int i = 0; i < sz(idxs) - 1; i++) {
            for (int j = i + 1; j < sz(idxs); j++) {
                int sz = idxs[j] - idxs[i] - 1;
                int num = j - i - 1;
                if (sz <= 0 || num <= 0) continue;
                ans = max(ans, (double) num / (double) sz);
            }
        }
        cout << fixed << setprecision(10) << ans << endl;
    }
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int test = 1;
    //cin >> test;
    for (int t = 0; t < test; t++) {
        solve();
    }
}

提出情報

ジャッジ結果