Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <stack>
- #include <climits>
- using namespace std;
- ifstream fin("numarare.in");
- ofstream fout("numarare.out");
- int a[101][101];
- stack<pair<int,int> >s;
- int main()
- {
- int n,m;
- fin>>n>>m;
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=m; j++)
- {
- fin>>a[i][j];
- }
- }
- for(int i=1; i<=m; i++)
- {
- a[1][i]+=max(a[1][i-1], a[0][i-1]);
- }
- for(int j=1; j<=n; j++)
- {
- a[j][1]+=max(a[j-1][1], a[j-1][0]);
- }
- for(int i=2; i<=n; i++)
- {
- for(int j=2; j<=m; j++)
- {
- a[i][j]+=max(a[i-1][j],a[i][j-1]);
- }
- }
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=m; j++)
- {
- fout<<a[i][j]<<" ";
- }
- fout<<endl;
- }
- s.push({n,m});
- int stopi, stopj;
- stopi=n;
- stopj=m;
- int i=n, j=m;
- while(i!=1 || j!=1)
- {
- a[i][j]-=max(a[i][j-1],a[i-1][j]);
- if(a[i][j-1]>a[i-1][j])
- {
- s.push({i,j-1});
- j--;
- }
- else
- {
- s.push({i-1,j});
- i--;
- }
- }
- while(!s.empty())
- {
- fout<<s.top().first<<" "<<s.top().second<<endl;
- s.pop();
- }
- fin.close();
- fout.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment