zoukankan      html  css  js  c++  java
  • 二维vector的遍历

        
    turnPoints是一个二维vector容器,下面代码实现了二维vector的逐个遍历,类似于以为数组
    float distance = 100;
    for(int i = 0; i < points.size()-1; i++)
    for(int j = i+1; j<points.size(); j++)
    {
    if(distance < (points[i]-points[j]).distance()))
    distance = (points[i]-points[j]).distance());
    }

    vector<vector<Point>>turnPoints;

    for(int i = 0; i < turnPoints.size()-1; i++) for(int j = 0; j < turnPoints[i].size()-1; j++) for(int m = i; m < turnPoints.size(); m++) { int n; if( m == i) n = j+1; else n = 0; for( ; n < turnPoints[m].size(); n++) { FPoint3 p = turnPoints[i][j] - turnPoints[m][n]; if(p.Length() < distance) distance = p.Length(); if(p.Length() < 10) { FPoint3 midP = (turnPoints[i][j] + turnPoints[m][n])/2; turnPoints[i][j] = midP; turnPoints[m][n] = midP; } } }
  • 相关阅读:
    可持续化线段树(主席树)
    2016-06-19 NOIP模拟赛
    0618图的整理
    1536 海战
    1005 生日礼物
    3280 easyfinding
    2594 解药还是毒药
    2919 选择题
    1845 二叉查找树
    1174 靶形数独
  • 原文地址:https://www.cnblogs.com/qingsunny/p/3225317.html
Copyright © 2011-2022 走看看