Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int n,m;
- int main(){
- scanf("%d %d",&n,&m);
- int mp[n+1][m+1],qs[n+1][m+1];
- for(int i=1;i<=n;i++){
- for(int j=1;j<=m;j++){
- scanf("%d",&mp[i][j]);
- qs[i-1][j]=1e9; qs[i][j-1]=1e9;
- }
- }
- for(int i=1;i<=n;i++){
- for(int j=1;j<=m;j++){
- if(i==1&&j==1){qs[i][j]=mp[i][j];}
- else{qs[i][j]=mp[i][j]+min(qs[i-1][j],qs[i][j-1]);}
- }
- }
- printf("%d",qs[n][m]);
- return 0;
- }
- //// เศษซากความพยายาม
- /*int n,m;
- int find(int i,int j,vector<vector<int>> &dp,vector<vector<int>> &mp){
- if(i==n-1&&j==m-1){return mp[i][j];}
- if(i==n||j==m){return 1e9;}
- if(dp[i][j]!=0){return dp[i][j];}
- return 0;//dp[i][j]=mp[i][j]+min(find(i+1,j,dp,mp),find(i,j+1,dp,mp));
- }
- int main(){
- scanf("%d %d",&n,&m);
- vector<vector<int>> dp,mp;
- for(int i=0;i<n;i++){
- for(int j=0;j<m;j++){
- int a;scanf("%d",&a);
- mp[i][j]=a;
- dp[i][j]=0;
- }
- }
- int ans=find(1,1,dp,mp);
- printf("%d",ans);
- return 0;
- }*/
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement