简单dp

#include<bits/stdc++.h>
using namespace std;
double a[105],dp[105][2];
int main(){
    memset(a,-1,sizeof a);
    memset(dp,-1,sizeof dp);
    int n; cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i];
    dp[0][0] = 100.00,dp[0][1] = 0.00;
    for(int i = 1;i <= n;i++){
        dp[i][0] = max(dp[i - 1][0],dp[i - 1][1] / a[i]);
        dp[i][1] = max(dp[i - 1][1],dp[i - 1][0] * a[i]);
    }
    printf("%.2lf",dp[n][0]);
    return 0;
}