Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<fstream>
- using namespace std;
- ifstream f("p14-veverita.in");
- ofstream g("p14-veverita.out");
- int a[101][101]; // a[i][j] = va retine cantitatea de ghinde.
- int c[101][101]; // c[i][j] = cantitatea maxima (castigul) ce se poate obtine ajungand in pozitia i,j;
- // c[i][j] = a[i][j] + max(c[i-1][j],c[i][j-1]);
- // adica nr de ghinde din pozitia curenta + (castigul obtinut daca se coboara in jos (c[i-1][j]) sau castigul obtinut daca se muta la dreapta (c[i][j-1]))
- int n,m,i,j;
- int max(int x, int y) {
- return x>y?x:y;
- }
- int main() {
- // citim datele din fisier
- f>>n>>m;
- for(i=1; i<=n; i++) {
- for(j=1; j<=m; j++) {
- f>>a[i][j];
- }
- }
- //calculam matricea castigurilor
- for(i=1; i<=n; i++) {
- for(j=1; j<=m; j++) {
- c[i][j] = a[i][j] + max(c[i-1][j],c[i][j-1]);
- }
- }
- g<<c[n][m];
- f.close();
- g.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement