c++代码优化，运行时间目前是9.8s（必须在gcc上运行），目标是6.5s以内，现在遇到瓶颈，如能解答报酬好说

#include
#include
#include
#include
using namespace std;

int main(int argc, char* argv[]) {

static const int nx(10000);

static const int ny(200);

static const int nt(200);
int i(0), j(0);

double* vi = new double[nx*ny];

double* vr = new double[nx*ny];

static const double pi = (4.*atan(1.) / double(nx));
memset(vr, 0, ny*nx * sizeof(double));
int iny((nx-1)*ny);
for (i = nx-1; i>=0; --i) {

    for (j = ny-1; j>=0; --j) {
        vi[iny + j] = double(i*i)*double(j)*sin(pi *double(i));
    }
    iny -= ny;
}


ofstream fout("data_out");
FILE *fp = fopen("data_out1", "w");
/*
ÏÂÃæµÄÑ»·Àï³öÏÖÁË·ÖÖ§£¬¸ù¾ÝÀÏÊ¦PPT£¬½«ÕâÀïµÄÑ»·²ð·Ö³ÉÈýÏî£¬¼õÉÙÁËÑ»·´ÎÊý¡£
i,j±»ÖØ¸´¶¨ÒåÁËÈý´Î£¬ÔÚÃ¿´ÎÑ»·ÖÐ
*/

for (int t = 0; t<nt; t++) {
    cout << "\n" << t; cout.flush();


    iny = ny;
    for (i = 1; i < nx - 1; ++i) {
        for (j = 1; j < ny - 1; ++j) {
            vr[iny + j] = (vi[iny+ny + j] + vi[iny-ny + j] + vi[iny + j - 1] + vi[iny + j + 1]) *0.25;
        }
        vr[iny] = (vi[iny+ny] + vi[iny-ny] + 15.45 + vi[iny + 1])*0.25;
        vr[iny + ny - 1] = (vi[iny+ny + ny - 1] + vi[iny-ny + ny - 1] + vi[iny + ny - 2] - 6.7)*0.25;
        iny += ny;
    }
    for (j = 1; j < ny - 1; ++j) {
        vr[j] = (vi[ny + j] + 10. + vi[j - 1] + vi[j + 1]) *0.25;
        vr[(nx - 1)*ny + j] = (5. + vi[(nx - 2)*ny + j] + vi[(nx - 1)*ny + j - 1] + vi[(nx - 1)*ny + j + 1])*0.25;
    }


    //ÕâÀïÊÇÏòÎÄ¼þÖÐÐ´±íµÄ²Ù×÷
    //vr¸³Öµ
    //ÕâÀï¶ÔviµÄÖµ½øÐÐÐÞ¸Ä

    iny = 0;
    for (i = 0; i<nx; ++i) {
        for (j = 0; j<ny - 2; ++j) {
            register double vr_(vr[iny + j]), vi_(vi[iny + j]);

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j <<" " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_=vr[iny + j]; vi_=vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
            ++j;

            vr_ = vr[iny + j]; vi_ = vi[iny + j];

            if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
                //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
                fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
            vi[iny + j] = (vr_ + vi_) * 0.5;
        }

        register double vr_(vr[iny + ny - 2]), vi_(vi[iny + ny - 2]);

        if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
            //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
            fout << "\n" << t << " " << i << " " << j << " " << vi_ << " " << vr_;
        vi[iny + ny - 2] = (vi_ + vr_) * 0.5;

        vr_ = fabs(vr[iny + ny - 1]); vi_=fabs(vi[iny + ny - 1]);

        if (vr_ - vi_<1e-2&&vr_ - vi_>-1e-2)
            //fprintf(fp, "\n%d %d %d %f %f", t, i, j, vi_, vr_);
            fout << "\n" << t << " " << i << " " << j <<" " << vi_ << " " << vr_;
        vi[iny + ny - 1] = (vi[iny + ny - 1] + vr[iny + ny - 1]) * 0.5;
        iny += ny;
    }

}

}

写回答
好问题 0 提建议
追加酬金
关注问题
分享
邀请回答
编辑收藏删除结题
收藏举报

1条回答默认最新

关注

码龄粉丝数原力等级 --

被采纳

被点赞

采纳率
zqbnqsdsmd 2018-11-12 16:16
关注
https://wenku.baidu.com/view/7199f4caf46527d3250ce030.html

解决无用
评论打赏
分享
举报

评论

按下Enter换行，Ctrl+Enter发表内容

报告相同问题？

关注问题

为什么在dev c++中能正常运行的代码，在gcc中无法运行 c语言有问必答
2022-10-09 16:54

回答 4 已采纳 fun函数中的scanf("%d",&n)移动到main函数的第一个printf后面，在main函数最后加return 0; 生成可执行程序后，直接运行就可以了， gcc a.exe的写法是错误的，
C++里这一句优化是什么意思？怎么用正常的代码替代？ c++
2022-11-05 10:28

回答 2 已采纳 inline参数的含义是建议编译器内联，实际是否内联由编译器决定。内联后编译器会为函数生成特殊的汇编代码。使用内联函数有如下优势：内联函数拥有更快的调用速度（减少了函数调用）；可以实现把函数代码集成
dev c++运行代码总出现Makefile.win c++
2022-03-24 23:01

回答 1 已采纳
C++_开发_项目开发编码规范
2023-05-27 00:28

123无敌，就你了的博客 C++_开发_项目开发编码规范
同样的C++代码编译后的exe文件，多次运行结果不同 c++ 数据结构
2022-11-08 17:21

回答 2 已采纳 for(int k=j; k< ( j+a.size()-i+1 ); k++) 这个循环越界了啊如果j,i都为0，那就是k<a.size()+1了。当k为a.size()，是越界访问，
为什么这串代码在Windows用gcc能编译成功但是运行起来是乱码用visual studio编译不通过用Linux编译能够成功编译并运行 c语言
2021-08-24 20:43

回答 3 已采纳你搜一下vscode使用scanf，vs现在默认禁止使用scanf，你去查一下关掉那个选项就可以了有帮助望采纳
这个代码是我在网上搜的，但看不明白，能给我在代码后面标上注释吗？ c语言
2022-04-29 17:35

回答 1 已采纳如有帮助，请采纳
C++ Google代码风格
2019-07-23 15:18

LanceFU的博客 C++ Google代码风格0 index（扉页）0.0 声明0.1 译者前言0.2 背景headers（头文件）1.1 Self-contained 头文件1.2. #define 保护1.3. 前置声明1.4. 内联函数1.5. #include 的路径及顺序译者（acgtyrant）笔记scoping...
C++菱形虚继承，为什么基类是排在内存最高位地址中？ c++ c语言
2022-10-09 09:57

回答 2 已采纳因为虚基类不管继承多少次，在派生对象中只能有一个子对象。如果把它放到前面的话，多继承时就会出现多个虚基类子对象。因此虚基类子对象是放在所有子对象之后的。 https://en.cppreference
gcc安装后在VScode中运行新项目提示没有输入文件，如何解决？ vscode
2022-08-15 22:10

回答 1 已采纳因为文件名中带空格，命令行中识别不了文件名中的空格，当做参数的分隔符了。2个办法1 修改文件名，删除空格。2 修改task.json中的args，把"${file}"修改为""${file}"",，用
C++的wcout用GCC编译不能输出中文但是用Clang编译的却可以？ c++ c语言
2022-06-08 12:22

回答 1 已采纳 const char *lcl = std::setlocale(LC_CTYPE, ""); std::ios_base::sync_with_stdio(false);
谷歌C++编程规范
2023-03-17 12:15

null_one的博客谷歌C++编程规范
代码运行后终端显示蓝字 c++ c语言有问必答
2022-03-27 15:48

回答 2 已采纳 c:\Users\lai.vscode\extensions\ms-vscode.cpptools-1.9.7\debugAdapters\bin\WindowsDebugLauncher.exe这是
【CSAPP:3e 深入理解计算机系统】课堂笔记 Computer Systems from a Programmer’s Perspective
2022-08-29 18:15

hairful的博客时间局部性：【使用同一个变量进行操作】被引用过一次的内存位置很可能在不远的将来再被多次引用空间局部性：【使用相邻位置的内存】被引用过的内存位置，它附近的内存位置很可能在不远的将来被引用假如多个模块定义...
C++ 风格指南
2022-01-02 17:46

烟雨平生、赵的博客 C++ 风格指南 - 内容目录文章目录C++ 风格指南 - 内容目录1. 头文件1.1. Self-contained 头文件1.2. #define 保护1.3. 前置声明1.4. 内联函数1.5. `#include` 的路径及顺序译者 (YuleFox) 笔记译者（acgtyrant）...
没有解决我的问题, 去提问

悬赏问题

¥15 名为“Product”的列已属于此 DataTable
¥15 安卓adb backup备份应用数据失败
¥15 eclipse运行项目时遇到的问题
¥15 关于#c##的问题：最近需要用CAT工具Trados进行一些开发
¥15 南大pa1 小游戏没有界面，并且报了如下错误，尝试过换显卡驱动，但是好像不行
¥15 没有证书，nginx怎么反向代理到只能接受https的公网网站
¥50 成都蓉城足球俱乐部小程序抢票
¥15 yolov7训练自己的数据集
¥15 esp8266与51单片机连接问题(标签-单片机|关键词-串口)（相关搜索：51单片机|单片机|测试代码）
¥15 电力市场出清matlab yalmip kkt 双层优化问题

c++代码优化，运行时间目前是9.8s（必须在gcc上运行），目标是6.5s以内，现在遇到瓶颈，如能解答报酬好说

1条回答 默认 最新

悬赏问题

1条回答默认最新