Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #pragma once
- #ifndef _ARRANGE_
- #define _ARRANGE_
- #include <iostream>
- #include <iomanip>
- using namespace std;
- template <typename T>
- class Arrange
- {
- private:
- T * * ar;
- int m;
- int n;
- T max;
- T k;
- public:
- Arrange();
- void input();
- void compare1();
- void compare2();
- ~Arrange();
- };
- #endif
- #include "Arrange.h"
- #include <iostream>
- #include <iomanip>
- using namespace std;
- template<typename T>
- Arrange::Arrange()
- {
- m = 0;
- n = 0;
- T** ar = new T*[m];
- for (int i = 0; i < m; i++)
- {
- ar[i] = new T[n];
- }
- max = 0;
- k = 0;
- }
- template<typename T>
- void Arrange::input()
- {
- cout << "vvedite kolichestvo strok" << endl;
- cin >> m;
- cout << "vvedite kolichestvo stolbcov" << endl;
- cin >> n;
- for (int i = 0; i < m; i++)
- {
- for (int j = 0; j < n; j++)
- {
- ar[i][j] = rand();
- }
- }
- }
- template<typename T>
- void Arrange::compare1()
- {
- int ia = 0;
- int ja = 0;
- max = ar[1][0];
- for (int i =1; i < m; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (i>=j)
- {
- if (ar[i][j] > max)
- {
- max = ar[i][j];
- ia = i;
- ja = j;
- }
- else
- {
- max = ar[i + 1][j + 1];
- ia = i + 1;
- ja = j + 1;
- }
- }
- }
- }
- cout << "max element" << max << " " << "index" << ia << ";" << ja << endl;
- }
- template <typename T>
- void Arrange::compare2()
- {
- int t = 1;
- for (int j = 0; j < m; j++)
- {
- for (int i = 0; i < n;)
- {
- k = (k + ar[i][j]) / t;
- if (k[i] > k[i + 1])
- {
- max = max + ar[i][j];
- }
- t++;
- i++;
- }
- }
- cout << "max summ" << max << endl;
- }
- template <typename T>
- Arrange::~Arrange()
- {
- }
- #include <iostream>
- #include <iomanip>
- #include "Arrange.h"
- using namespace std;
- int main()
- {
- Arrange<int> obg;
- obg.input();
- obg.compare1();
- obg.compare2();
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement