高斯消元法求解概率dp,自己做的时候看出来是需要用到高斯消元了,但是实在是想不到怎么创建方程,后来搜了一下,发现大家建方程的方法都是一样的,只是没有人解释为什么这么建方程,菜鸟表示不能理解~~~只好先抄下来慢慢理解了。。。
目测是用马尔可夫过程证明得到的。。。
注:在已知它所处的状态的条件下,它未来的演变不依赖于它以往的演变。这种已知“现在”的条件下,“将来”与“过去”独立的特性称为马尔可夫性,具有这种性质的随机过程叫做马尔可夫过程。
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cmath>
#define LL long long
#define CLR(a, b) memset(a, b, sizeof(a))
#define eps 1e-9
using namespace std;
const int N = 222;
double a[N][N], p[N];
inline int sgn(double d) {
if (fabs(d) < eps) return 0;
return d > 0 ? 1 : -1;
}
int gauss(int N, int M){
int i, j, r, c, pvt;
double maxp;
for (r = 0, c = 0; r < N && c < M; ++ r, ++ c) {
for (maxp = 0, i = r; i < N; ++ i)
if (fabs(a[i][c])>fabs(maxp)) maxp = a[pvt=i][c];
if (sgn(maxp) == 0) {
r--;
continue;
}
if (pvt != r)
for (j = r; j <= M; ++j) swap(a[r][j], a[pvt][j]);
for (j = c+1; j <= M; ++j) {
a[r][j] /= maxp;
for (i = r+1; i < N; ++i)
a[i][j] -= a[i][c]*a[r][j];
}
}
for (i = r; i < N; ++i)
if (sgn(a[i][M])) return -1;
if (r < M) return M-r;
for (i = M-1; i >= 0; --i)
for (j = i+1; j < M; ++j)
a[i][M] -= a[j][M]*a[i][j];
return 0;
}
int n, m;
int ind[N], cnt;
void bfs(int s)
{
int u, v, i, j;
queue<int> Q;
Q.push(s);cnt = 0;
ind[s] = cnt ++;
while(!Q.empty())
{
u = Q.front();
Q.pop();
for(i = 1; i <= m; i ++)
{
if(sgn(p[i]) == 0) continue;
v = (u + i) % n;
if(ind[v] == -1)
{
ind[v] = cnt ++;
Q.push(v);
}
}
}
}
int main()
{
int t, y, x, d, i, j;
scanf("%d", &t);
while(t --)
{
scanf("%d%d%d%d%d", &n, &m, &y, &x, &d);
for(i = 1; i <= m; i ++) scanf("%lf", &p[i]), p[i] /= 100;
CLR(ind, -1);
CLR(a, 0);
if(x == y)
{
puts("0.00");
continue;
}
n = (n - 1) * 2;
if(d == 1) x = n - x;
bfs(x);
if(ind[y] == -1 && ind[n - y] == -1)
{
puts("Impossible !");
continue;
}
for(i = 0; i < n; i ++)
{
if(i == y || i == n - y)
{
a[ind[i]][ind[i]] = 1;
a[ind[i]][cnt] = 0;
continue;
}
a[ind[i]][ind[i]] = 1;
for(j = 1; j <= m; j ++)
{
a[ind[i]][ind[(i + j) % n]] -= p[j];
a[ind[i]][cnt] += p[j] * j;
}
}
if(gauss(cnt, cnt) == 0)
{
printf("%.2lf\n", a[ind[x]][cnt]);
}
else puts("Impossible !");
}
}