F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_36315394_10142.cpp:18:37: error: invalid types 'int[int]' for array subscript
 int n, m, t, p, g[55][155], f[55[505][5];
                                     ^
0_0_36315394_10142.cpp:18:41: error: expected ']' before ';' token
 int n, m, t, p, g[55][155], f[55[505][5];
                                         ^
0_0_36315394_10142.cpp: In function 'void Solve()':
0_0_36315394_10142.cpp:49:17: error: 'f' was not declared in this scope
                 f[i[j][k] = -INF;
                 ^
0_0_36315394_10142.cpp:49:22: error: invalid types 'long long int[long long int]' for array subscript
                 f[i[j][k] = -INF;
                      ^
0_0_36315394_10142.cpp:49:33: error: expected ']' before ';' token
                 f[i[j][k] = -INF;
                                 ^
0_0_36315394_10142.cpp:53:5: error: 'f' was not declared in this scope
     f[0[0][0] = 0;
     ^
0_0_36315394_10142.cpp:53:10: error: invalid types 'int[int]' for array subscript
     f[0[0][0] = 0;
          ^
0_0_36315394_10142.cpp:53:18: error: expected ']' before ';' token
     f[0[0][0] = 0;
                  ^
0_0_36315394_10142.cpp:66:42: error: invalid types 'long long int[long long int]' for array subscript
                         if(l >= 60) f[i[j][k] = max(f[[ij][k], f[j[i - 1 - g[i][l]][k] + min(l, 100ll));
                                          ^
0_0_36315394_10142.cpp:66:54: error: two consecutive '[' shall only introduce an attribute before '[' token
                         if(l >= 60) f[i[j][k] = max(f[[ij][k], f[j[i - 1 - g[i][l]][k] + min(l, 100ll));
                                                      ^
0_0_36315394_10142.cpp:66:104: error: expected ']' before ';' token
                         if(l >= 60) f[i[j][k] = max(f[[ij][k], f[j[i - 1 - g[i][l]][k] + min(l, 100ll));
                                                                                                        ^
0_0_36315394_10142.cpp:68:33: error: invalid types 'long long int[long long int]' for array subscript
                     } else f[i[j][k] = max(f[[ij][k], max(f[j[i - 1][k - 1], f[j[i - 1 - g[i][l] ][k - (l < 60)] + min(l, 100ll)));
                                 ^
0_0_36315394_10142.cpp:68:45: error: two consecutive '[' shall only introduce an attribute before '[' token
                     } else f[i[j][k] = max(f[[ij][k], max(f[j[i - 1][k - 1], f[j[i - 1 - g[i][l] ][k - (l < 60)] + min(l, 100ll)));
                                             ^
0_0_36315394_10142.cpp:68:131: error: expected ']' before ';' token
                     } else f[i[j][k] = max(f[[ij][k], max(f[j[i - 1][k - 1], f[j[i - 1 - g[i][l] ][k - (l < 60)] + min(l, 100ll)));
                                                                                                                                   ^
0_0_36315394_10142.cpp:76:57: error: invalid types 'long long int[long long int]' for array subscript
         for(int k = 0; k <= p; k++) ans = max(ans, f[n[j][k]);
                                                         ^
0_0_36315394_10142.cpp:76:61: error: expected ']' before ')' token
         for(int k = 0; k <= p; k++) ans = max(ans, f[n[j][k]);
                                                             ^


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-23 02:30:49, Gzip enabled