Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <queue>
- using namespace std;
- int maks3(int a, int b, int c){
- if(a>=b&&a>=c){
- return a;
- }else if(b>a&&b>=c){
- return b;
- }else{
- return c;
- }
- }
- int maks2(int a, int b){
- if(a>=b){
- return a;
- }else{
- return b;
- }
- }
- int main()
- {
- ios_base::sync_with_stdio(false);
- int n, m, l_grzybow, maks=0, kol=0;
- cin>>n>>m;
- if(n==1){
- int pom;
- for(int i=0;i<m;i++){
- cin>>pom;
- if(pom>maks){
- l_grzybow=pom;
- kol=i;
- }
- }
- }else{
- if(m==1){
- int pom;
- for(int i=0;i<n;i++){
- cin>>pom;
- l_grzybow=l_grzybow+pom;
- }
- }else{
- int tabpom[m], tab[2][m];
- for(int i=0;i<m;i++){
- tab[0][i]=0;
- tab[1][i]=0;
- }
- int j;
- for(j=0;j<n;j++){
- for(int i=0;i<m;i++){
- cin>>tabpom[i];
- if(i==0){
- tab[j%2][i]=maks2(tab[(j-1)%2][i],tab[(j-1)%2][i+1])+tabpom[i];
- }else if(i==(m-1)){
- tab[j%2][i]=maks2(tab[(j-1)%2][i],tab[(j-1)%2][i-1])+tabpom[i];
- }else{
- tab[j%2][i]=maks3(tab[(j-1)%2][i-1],tab[(j-1)%2][i],tab[(j-1)%2][i+1])+tabpom[i];
- }
- }
- }
- for(int i=0;i<m;i++){
- if(tab[j%2][i]>maks){
- maks=tab[j%2][i];
- kol=i;
- }
- }
- l_grzybow=maks;
- }
- }
- cout<<kol<<" "<<l_grzybow<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement