博客
关于我
PTA L1-027 出租 (20 分)
阅读量:282 次
发布时间:2019-03-01

本文共 1173 字,大约阅读时间需要 3 分钟。

?????????????

????????????????????????????????????????????????????arr?index?arr???????????????index????????????

?????arr??????????????????????index?????????????????????????????18013820100?arr????8,3,2,1,0??index?????3,0,4,3,1,0,2,4,3,4,4?

???????????????????????11?????????????????????????????

  • ????????????????arr???
  • ????????index??
  • ??arr?index?????
  • ???????????

    #include 
    #include
    #include
    #include
    using namespace std;int main() { string s; while (cin >> s) { vector
    a(11), b(11); for (int i = 0; i < 11; ++i) { a[i] = s[i] - '0'; b[i] = i; } sort(a.begin(), a.end(), greater
    ()); for (int i = 0; i < 11; ++i) { if (find(b.begin(), b.end(), a[i]) != b.end()) { b.erase(find(b.begin(), b.end(), a[i]), 1); } } cout << "int[] arr = new int[" << arr.size() << "][" << arr << "];" << endl; cout << "int[] index = new int[" << b.size() << "][" << b << "];" << endl; } return 0;}

    ??????????????????????????arr?index??????????????????????a?????a??????????????????????index??????????????????????????????????????

    转载地址:http://qrvo.baihongyu.com/

    你可能感兴趣的文章
    POJ 3041 Asteroids(二分匹配模板题)
    查看>>
    Qt笔记——标准文件对话框QFileDialog
    查看>>
    poj 3083 Children of the Candy Corn
    查看>>
    POJ 3083 Children of the Candy Corn 解题报告
    查看>>
    POJ 3253 Fence Repair C++ STL multiset 可解 (同51nod 1117 聪明的木匠)
    查看>>
    Qt笔记——控件总结
    查看>>
    poj 3262 Protecting the Flowers 贪心
    查看>>
    poj 3264(简单线段树)
    查看>>
    Qt笔记——布局管理三件套分割窗口、停靠窗口和堆栈窗口
    查看>>
    poj 3277 线段树
    查看>>
    POJ 3349 Snowflake Snow Snowflakes
    查看>>
    POJ 3411 DFS
    查看>>
    poj 3422 Kaka's Matrix Travels (费用流 + 拆点)
    查看>>
    Qt笔记——官方文档全局定义(二)Functions函数
    查看>>
    POJ 3468 A Simple Problem with Integers
    查看>>
    poj 3468 A Simple Problem with Integers 降维线段树
    查看>>
    poj 3468 A Simple Problem with Integers(线段树 插线问线)
    查看>>
    poj 3485 区间选点
    查看>>
    poj 3518 Prime Gap
    查看>>
    poj 3539 Elevator——同余类bfs
    查看>>