zoukankan      html  css  js  c++  java
  • 杭电acm2022

    http://acm.hdu.edu.cn/showproblem.php?pid=2022

    存入,逐个比较即可,当然边存入边比较会更快

    View Code
     1 #include<stdio.h>
     2 #include<math.h>
     3 int main()
     4 {
     5     int n,m,i,j,x,y,s;
     6     int a[100][100];
     7     while(scanf("%d%d",&n,&m)!=EOF)
     8     {
     9         for(i=0;i<n;i++)
    10           for(j=0;j<m;j++)
    11             scanf("%d",&a[i][j]);
    12         x=y=0;
    13         s=a[0][0];
    14         for(i=0;i<n;i++)
    15            for(j=0;j<m;j++)
    16              if(fabs(a[i][j])>fabs(s))
    17              {
    18                 s=a[i][j];
    19                 x=i;
    20                 y=j;
    21              }
    22              else if(fabs(a[i][j])==fabs(s))
    23              {
    24                 if(i<x)
    25                 {
    26                   s=a[i][j];
    27                   x=i;
    28                   y=j;
    29                 }
    30                 else if(i==x&&j<y)
    31                 {
    32                     s=a[i][j];
    33                     x=i;
    34                     y=j;
    35                 }
    36              }
    37     printf("%d %d %d\n",x+1,y+1,s);
    38     }
    39   return 0;
    40 }
  • 相关阅读:
    leetcode 34 rust
    leetcode 2 rust
    leetcode 1 rust
    leetcode 20 rust
    leetcode 287 rust
    leetcode 18 rust
    lottery抽奖
    webpack
    webpack(7)-生产环境
    webpack(6)-模块热替代&tree shaking
  • 原文地址:https://www.cnblogs.com/huzhenbo113/p/3019272.html
Copyright © 2011-2022 走看看