海选女主角
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 | #include <cstdio> #include <iostream> #include <algorithm> #include <cmath> using namespace std; int main() { int m, n; while ( scanf ( "%d %d" , &m, &n) != EOF) { int a[m + 2][n + 2]; int cmax, cmax_i, cmax_j; for ( int i = 1; i <= m; ++ i) { for ( int j = 1; j <= n; ++ j) { scanf ( "%d" , &a[i][j]); } } cmax = a[1][1]; cmax_i = 1; cmax_j = 1; for ( int i = 1; i <= m; ++ i) { for ( int j = 1; j <= n; ++ j) { if ( abs (a[i][j]) > abs (cmax)) { cmax = a[i][j]; cmax_i = i; cmax_j = j; } } } printf ( "%d %d %d\n" , cmax_i, cmax_j, cmax); } return 0; } |
Time Limit Exceeded(没有加!=EOF)->Runtime Error(数组开小了)
(ACCESS_VIOLATION)->Accepted
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步