数值分析2.2 直接三角分解方法

#include 
#include 
#include 
using namespace std;
const int MAXN = 1000;
double a[MAXN][MAXN];
double l[MAXN][MAXN];
double u[MAXN][MAXN];
double b[MAXN];
double x[MAXN];
double y[MAXN];
int main()
{
    int n;
    double maxs;
    freopen("in.txt","r",stdin);
    while(cin >> n){
        for(int i = 0;i> b[i];
        for(int i = 0;i> a[i][j];
            }
        }
        //memset(l,0,sizeof(l));
        //memset(u,0,sizeof(u));
        for(int i = 0;i=0;i--){
                x[i] = y[i];
            for(int j = n-1;j>i;j--){
                x[i]-=u[i][j]*x[j];
            }
            x[i]/=u[i][i];
        }
        ///输出
        for(int i = 0;i