1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
| #include <iostream>
#include <string>
#include <fstream>
using Marks = int[5];
struct STUDENT
{
std::string FIO;
short course;
short groupe;
Marks marks;
STUDENT() {};//конструктор
STUDENT(std::ifstream& file);//каркас чтения одного студента
void print();
int compare(const STUDENT& student);
int kind();
};
struct NODE
{
STUDENT info;
NODE* next;
NODE* prev;
NODE(STUDENT student, NODE* next = nullptr, NODE* prev = nullptr) :info(student), next(next),prev(prev) {};
~NODE() { next = nullptr; prev = nullptr; }
};
using ptrNODE = NODE*;
struct DoublyLinkedList
{
ptrNODE begin, end;
size_t size; //самостоятельно добавить
DoublyLinkedList() { begin = nullptr; end = nullptr; }
DoublyLinkedList(const char* file_name); //CreateOrder
void First_node(const STUDENT& student);
bool Empty();
void Add_after_node(ptrNODE pNode, const STUDENT& student);
void Add_before_node(ptrNODE pNode, const STUDENT& student);
STUDENT& Delete(ptrNODE& pNode);
void Print();
~DoublyLinkedList();
};
void task_1(DoublyLinkedList& Dlist)
{
ptrNODE ptr = Dlist.begin;
while (ptr)
{
if (ptr->info.kind() == 2)
Dlist.Delete(ptr);
else
ptr = ptr->next;
}
}
int task_2(const DoublyLinkedList& Dlist)
{
int result = 0;
int count = 0;
int max = 0;
ptrNODE ptr = Dlist.begin;
int cur_course = ptr->info.course;
while (ptr)
{
if (ptr->info.course == cur_course)
{
if (ptr->info.kind() == 5)
count++;
ptr = ptr->next;
}
else
{
if (count > max)
{
max = count;
result = cur_course;
}
cur_course = ptr->info.course;
count = 0;
}
}
if (count > max)
{
//max = count;
result = cur_course;
}
return result;
}
int main()
{
//DoublyLinkedList Dlist;
std::ifstream file("data.txt");
//проверка файла
DoublyLinkedList Dlist("data.txt");
Dlist.Print();
task_1(Dlist);
Dlist.Print();
int course = task_2(Dlist);
if (course)
std::cout << course << 'n';
else
std::cout << "No\n";
std::cin.get();
return 0;
}
STUDENT::STUDENT(std::ifstream& file)
{
std::getline(file, FIO);
file >> course >> groupe;
for (short i = 0; i < 5; i++)
file >> marks[i];
file.ignore();
std::string delim_line;
std::getline(file, delim_line);
}
void STUDENT::print()
{
std::cout << FIO << '\n';
std::cout << course << '\n' << groupe << '\n';
for (short i = 0; i < 5; i++)
std::cout << marks[i] << ' ';
std::cout << "\n------------------\n";
}
int STUDENT::compare(const STUDENT& student)
{
int result = 1;
if (course < student.course ||
course == student.course && groupe < student.groupe ||
course == student.course && groupe == student.groupe && FIO < student.FIO)
result = -1;
else
if (course == student.course && groupe == student.groupe && FIO < student.FIO)
result = 0;
return result;
}
int STUDENT::kind()
{
int result = marks[0];
for (int i = 0; i < 5; i++)
if (marks[i] < result)
result = marks[i];
return result;
}
ptrNODE Find_place(ptrNODE begin, const STUDENT& student)
{
ptrNODE p = begin;
while (p && p->info.compare(student) < 0)
p = p->next;
return p;
}
DoublyLinkedList::DoublyLinkedList(const char* file_name)
{
std::ifstream file(file_name);
STUDENT student(file);
First_node(student);
ptrNODE place;
while (!file.eof())
{
STUDENT student(file);
place = Find_place(begin, student);
if (place)
Add_before_node(place, student);
else
Add_after_node(end, student);
}
file.close();
}
void DoublyLinkedList::First_node(const STUDENT& student)
{
begin = new NODE(student);
end = begin;
}
bool DoublyLinkedList::Empty()
{
return begin == nullptr;
}
void DoublyLinkedList::Add_after_node(ptrNODE pNode, const STUDENT& student)
{
ptrNODE p = new NODE(student, pNode->next, pNode);
if (pNode == end)
end = p;
else
pNode->next->prev = p;
pNode->next = p;
}
void DoublyLinkedList::Add_before_node(ptrNODE pNode, const STUDENT& student)
{
ptrNODE p = new NODE(student, pNode, pNode->prev);
if (pNode == begin)
begin = p;
else
pNode->prev->next = p;
pNode->prev = p;
}
STUDENT& DoublyLinkedList::Delete(ptrNODE& pNode)
{
ptrNODE p = pNode;
if (pNode == begin)
{
begin = p->next;
pNode = begin;
if (p->next)
p->next->prev = nullptr;
}
else
if (pNode == end)
{
end = p->prev;
pNode = end;
if (p->prev)
p->prev->next = nullptr;
}
else
{
pNode = pNode->next;
p->next->prev = p->prev;
p->prev->next = p->next;
}
static STUDENT student;
student = p->info;
delete p;
return student;
}
void DoublyLinkedList::Print()
{
ptrNODE ptr = begin;
while (ptr)
{
ptr->info.print();
ptr = ptr->next;
}
}
DoublyLinkedList::~DoublyLinkedList()
{
while (!Empty())
Delete(begin);
//проверка на утечку тут
} |
(
Сообщение от vetalko2
