Ajde mala pomos?

This message was edited 2 times. Last update was at 21/03/2019 18:30:42

Zdravo, imam problem okolu zadacata Stolici link:
http://mendo.mk/Task.do?id=189
Moze da mi ja najdete greskata?
kod:

#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
 
using namespace std;
 
 
/*
20
18:00:00 23:59:00
19:00:00 23:59:00
20:00:00 23:59:00
20:00:00 20:00:00
19:59:00 19:59:00
10:00:00 15:59:00
11:00:00 15:59:00
12:00:00 15:59:00
12:00:00 12:00:00
11:59:00 11:59:00
10:00:00 23:59:01
10:00:00 23:58:59
00:00:01 00:00:02
00:00:02 00:00:03
00:00:03 00:00:04
00:00:04 00:00:04
00:00:04 00:00:05
08:10:00 08:11:00
08:10:00 08:12:00
08:10:00 23:59:58
*/
 
struct vv {
 
long long vkupno, vkupno1;
};
int main()
{
int n;
cin >> n;
string *pocetoci = new std::string[n];
string *kraevi = new std::string[n];
for (int i = 0; i<n; i++)
{
cin >> pocetoci[i] >> kraevi[i];
 
}
 
int MAX = 0;
int curr = 0;
vector<vv> v;
for (int i = 0; i<n; i++)
{
curr = 0;
std::string time = pocetoci[i];
int hrs = atoi(time.substr(0, 2).c_str());
int mins = atoi(time.substr(3, 2).c_str());
int secs = atoi(time.substr(6, 2).c_str());
 
std::string time1 = kraevi[i];
int hrs1 = atoi(time1.substr(0, 2).c_str());
int mins1 = atoi(time1.substr(3, 2).c_str());
int secs1 = atoi(time1.substr(6, 2).c_str());
long long vkupno = hrs * 60 * 60 + mins * 60 + secs;
long long vkupno1 = hrs1 * 60 * 60 + mins1 * 60 + secs1;
 
vv tmp;
tmp.vkupno = vkupno;
tmp.vkupno1 = vkupno1;
v.push_back(tmp);
}
 
vector<int> lis(n, 1);
 
for (int i = 1; i < n; i++)
{
for (int j = 0; j < n; j++)
{
if ((v[i].vkupno <= v[j].vkupno && v[i].vkupno1 >= v[j].vkupno1) && lis[i] < lis[j] + 1)
{
lis[i] = lis[j] + 1;
}
}
}
 
for (int i = 0; i < lis.size(); i++)
{
if (MAX < lis[i])
MAX = lis[i];
}
 
cout << MAX+1 << endl;
return 0;
}

This message was edited 1 time. Last update was at 11/06/2017 17:01:09

BATIR wrote:Zdravo, imam problem okolu zadacata Stolici link:
http://mendo.mk/Task.do?id=189
Moze da mi ja najdete greskata?

Хм, треба само да видиш во која секунда од денот има најмногу луѓе. Некако вака (сменет е само последниот дел од твојот код)...

#include <iostream>
#include <vector>
#include <string>
#include <cstdlib>
  
using namespace std;
  
  
/*
20
18:00:00 23:59:00
19:00:00 23:59:00
20:00:00 23:59:00
20:00:00 20:00:00
19:59:00 19:59:00
10:00:00 15:59:00
11:00:00 15:59:00
12:00:00 15:59:00
12:00:00 12:00:00
11:59:00 11:59:00
10:00:00 23:59:01
10:00:00 23:58:59
00:00:01 00:00:02
00:00:02 00:00:03
00:00:03 00:00:04
00:00:04 00:00:04
00:00:04 00:00:05
08:10:00 08:11:00
08:10:00 08:12:00
08:10:00 23:59:58
*/
  
struct vv {
  
long long vkupno, vkupno1;
};
int main()
{
int n;
cin >> n;
string *pocetoci = new std::string[n];
string *kraevi = new std::string[n];
for (int i = 0; i<n; i++)
{
cin >> pocetoci[i] >> kraevi[i];
  
}
  
int MAX = 0;
int curr = 0;
vector<vv> v;
for (int i = 0; i<n; i++)
{
curr = 0;
std::string time = pocetoci[i];
int hrs = atoi(time.substr(0, 2).c_str());
int mins = atoi(time.substr(3, 2).c_str());
int secs = atoi(time.substr(6, 2).c_str());
  
std::string time1 = kraevi[i];
int hrs1 = atoi(time1.substr(0, 2).c_str());
int mins1 = atoi(time1.substr(3, 2).c_str());
int secs1 = atoi(time1.substr(6, 2).c_str());
long long vkupno = hrs * 60 * 60 + mins * 60 + secs;
long long vkupno1 = hrs1 * 60 * 60 + mins1 * 60 + secs1;
  
vv tmp;
tmp.vkupno = vkupno;
tmp.vkupno1 = vkupno1;
v.push_back(tmp);
}
  
vector<int> inside(24 * 3600);
  
for (int i = 0; i < n; i++)
{
     for(int j=v[i].vkupno; j <= v[i].vkupno1; j++){
          inside[j]++;
     }
}
  
for (int i = 0; i < inside.size(); i++)
{
     if (MAX < inside[i])
          MAX = inside[i];
}
  
cout << MAX << endl;
return 0;
}