Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int main(){
- int n, m;
- cin >> n >> m;
- int bajtek[n + 1][m + 1], bitek[n + 1][m + 1];
- bajtek[0][0] = bitek[0][0] = 0;
- for(int i = 1;i <= n;i++){
- if(i % 2 == 0){
- cin >> bitek[i][0];
- bitek[i][0] += bitek[i - 1][0];
- bajtek[i][0] = bajtek[i - 1][0];
- }
- else{
- cin >> bajtek[i][0];
- bajtek[i][0] += bajtek[i - 1][0];
- bitek[i][0] = bitek[i - 1][0];
- }
- }
- for(int i = 1;i <= m;i++){
- if(i % 2 == 0){
- cin >> bitek[0][i];
- bitek[0][i] += bitek[0][i - 1];
- bajtek[0][i] = bajtek[0][i - 1];
- }
- else{
- cin >> bajtek[0][i];
- bajtek[0][i] += bajtek[0][i - 1];
- bitek[0][i] = bitek[0][i - 1];
- }
- }
- for(int i = 1;i <= n;i++)
- for(int j = 1;j <= m;j++){
- if((i + j) % 2 == 1){
- bajtek[i][j] = min(bitek[i][j - 1], bitek[i - 1][j]);
- bitek[i][j] = max(bitek[i][j - 1], bitek[i - 1][j]);
- }
- else{
- bitek[i][j] = min(bajtek[i][j - 1], bajtek[i - 1][j]);
- bajtek[i][j] = max(bajtek[i][j - 1], bajtek[i - 1][j]);
- }
- }
- for(int i = 0;i <= n;i++){
- for(int j = 0;j <= m;j++)
- cout << bajtek[i][j] << ' ';
- cout << '\n';
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement