# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67015 | ege_eksi | Maxcomp (info1cup18_maxcomp) | C++14 | 4 ms | 588 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<climits>
#include<algorithm>
using namespace std;
int n , m ;
int **matrix;
bool *visited;
int **dp;
int main()
{
scanf("%d %d" , &n , &m);
matrix = new int*[n];
for(int i = 0 ; i < n ; i++)
{
matrix[i] = new int[m];
}
for(int i = 0 ; i < n ; i++)
{
for(int j = 0 ; j < m ; j++)
{
scanf("%d" , &matrix[i][j]);
}
}
//subtask 2
if(n == 1)
{
int ans = 0;
for(int i = 0 ; i < m ; i++)
{
int maxi = matrix[0][i];
int mini = matrix[0][i];
int s = 1;
for(int j = i+1 ; j < m ; j++)
{
maxi = max(maxi , matrix[0][j]);
mini = min(mini , matrix[0][j]);
s++;
ans = max(ans , maxi - mini - s);
}
}
printf("%d" , ans);
}
// subtask 1
if(n * m <= 20)
{
visited = new bool[400];
dp = new int*[400];
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |