-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
197 lines (174 loc) · 4.45 KB
/
main.cpp
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
//Nail Guseynov
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <locale.h>
#include <utility>
using namespace std;
FILE *in=fopen("mass.txt","rt");
FILE *out=fopen("S1max.txt","w");
//×òåíèå ìàññèâà èç ôàéëà
void create_mass(int mass[], int N)
{
int i=0,err=0;
printf("Èñõîäíûé ìàññèâ: ");
for (i=0; i<N; i++)
{
fscanf(in,"%d",&mass[i]);
printf("%d ", mass[i]);
if (mass[i]<-1000000||mass[i]>1000000)
{
printf("\n----Ýëåìåíòû ìàññèâà ëåæàò íå â äèàïàçîíå!----\n");
err=1;
}
if (err==1) exit(1);
}
}
//Íàõîæäåíèå ìàêñèìàëüíîé ñóììû R1
void compute_max(int mass[], int N)
{
int S1=0,S1max=-1000000;
for(int A = 0; A<N; A++)
{
for(int B = 0; B<N; B++)
{
if(A<=B)
{
for(int k = A; k <= B; k++)
S1 += mass[k];
if(S1 > S1max)
{
S1max = S1;
fprintf(out,"%d\n",S1max);
}
S1=0;
}
else
{
continue;
}
}
}
}
//Ñðàâíåíèå ìàññèâîâ
bool compute_R2(int mass[], int mass2[], int NC, int ND)
{
bool ch1=true, ch2=true;
for(int i = 0; i < NC; i++){
ch1 = false;
for(int j = 0; j < ND; j++)
if(mass[i] == mass2[j]){
ch1 = true;
break;
}
if(ch1 == false)
break;
}
for(int j = 0; j < ND; j++){
ch2 = false;
for(int i = 0; i < NC; i++)
if(mass2[j] == mass[i]){
ch2 = true;
break;
}
if(ch2 == false)
break;
}
/* if(ch1&ch2){
printf("Yes\n");
}
else
printf("No\n");
*/
return ch1&ch2;
}
//Ñîçäàíèå äèíàìè÷åñêîãî ìàññèâà
int new_array(int mass[], int N)
{
int NC = 0;
int ND = 0;
int D = 0;
int k = 0;
for(int C = 0; C < N; C++){
for(int D_i = 0; D_i < N; D_i++){
NC = C+1;
ND = N-D_i;
int *dmassC, *dmassD;
dmassC = (int*)malloc(NC * sizeof(int)); //Âûäåëåíèå ïàìÿòè
dmassD = (int*)malloc(ND * sizeof(int));
//printf("\n\nC: %d D: %d\n", C,D_i);
for(int i = 0; i<NC; i++) {
dmassC[i]=mass[i];
}
D = D_i;
for(int j = 0; j<ND; j++)
{
dmassD[j]=mass[D];
D++;
}
/*printf("MassC ");
for (int i=0; i<NC; i++)
{
printf("%d ", dmassC[i]);
}
printf("\nMassD ");
for (int j=0; j<ND; j++)
{
printf("%d ", dmassD[j]);
}*/
if(compute_R2(dmassC, dmassD, NC, ND))
k++;
free(dmassC); //Îñâîáîæäåíèå ïàìÿòè
free(dmassD);
}
}
printf("\nÊîëè÷åñòâî R2: %d \n",k);
fprintf(out,"%d\n",k); //Êîëè÷åñòâî ðàçáèåíèé R2
return k;
}
//Ïåðåñòàíîâêà ýëåìåíòà ìàññèâà
void swap_func(int mass[],int N)
{
int i=0, j=0;
printf("\n----Ïåðåñòàíîâêà ýëåìåíòà ìàññèâà----\n");
printf("Ââåäèòå i è j ÷åðåç ïðîáåë\n");
scanf("%d %d", &i,&j);
if (i!=j&&mass[i]!=mass[j])
{
if (0<=i&&i<=j&&j<N)
{
swap(mass[i],mass[j]);
printf("Ïîñëå ïåðåñòàíîâêè \n%d %d\n", mass[i], mass[j]);
}
else printf("Ïåðåñòàíîâêà íå òðåáóåòñÿ!\n");
}
}
int main()
{
int N=0;
setlocale(LC_ALL,"RUS");
if (!in) printf("----Âõîäíîé ôàéë íå íàéäåí!----\n");
else
{
printf("----Ôàéë óñïåøíî îòêðûò!----\n");
fscanf(in,"%d",&N);
if (N>100000||N<1)
{
printf("\nN âûõîäèò çà ãðàíèöó äèàïàçîíà!\n");
return 0;
}
int arr[N];
create_mass(arr,N);
fprintf(out,"Ñóììà ðàçáèåíèÿ R1 äî ïåðåñòàíîâêè\n");
compute_max(arr,N);
fprintf(out,"\nÊîëè÷åñòâî ðàçáèåíèé R2\n");
new_array(arr, N);
swap_func(arr,N);
fprintf(out,"\nÑóììà ðàçáèåíèÿ R1 ïîñëå ïåðåñòàíîâêè\n");
compute_max(arr,N);
}
fclose(in);
fclose(out);
system("pause");
return 0;
}