<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
	<channel>
		<title><![CDATA[Latest posts for the topic "Handshakes"]]></title>
		<link>http://mendo.mk/jforum/posts/list/7.page</link>
		<description><![CDATA[Latest messages posted in the topic "Handshakes"]]></description>
		<generator>JForum - http://www.jforum.net</generator>
			<item>
				<title>Handshakes</title>
				<description><![CDATA[ Vekje ima edna tema na ovaa zadaca, i znam deka otprilika e slicna kako zadacata od drzavniot no sepak razlicna. Ama ovoj pat ja analizirav podobro i pravam pristap so brute-force, vaka nesto. Bidejki pravam while se dodeka ima promeni, a dolzinata na stringot moze da bide do 100000, zatoa toa bi pagjalo na vreme.<br /> Eve go kodot koj pominuva na 7/10 test sluchai, kade shto poslednite tri pagjaat na vreme. Eve go kodot shto go iskucav, kje zamolam nekoj koj ja ima reseno zadacata, ili znae kako se resava, da mi dade idea za nekoj pristap, shto ne e brute-force. Fala odnapred.<br /> http://mendo.mk/Task.do?id=196<br /> [code]<br /> #include &lt;bits/stdc++.h&gt;<br /> <br /> using namespace std;<br /> <br /> int main()<br /> {<br />     string s;<br />     cin&gt;&gt;s;<br />     int n=s.size();<br />     bool moves=true;<br />     int handshakes=0;<br />     int time=0;<br />     int o=0;<br />     while(moves)<br />     {<br />         moves=false;<br />         for(int i=0; i&lt;n-1; i++)<br />         {<br />             if(s[i]=='R' && s[i+1]=='L')<br />             {<br />                 handshakes++;<br />                 moves=true;<br />                 swap(s[i],s[i+1]);<br />                 i++;<br />             }<br />         }<br />         if(moves)<br />         {<br />             time++;<br />             o++;<br />         }<br />         else<br />         {<br />             break;<br />         }<br />     }<br />     cout&lt;&lt;time&lt;&lt;" "&lt;&lt;handshakes&lt;&lt;endl;<br />     return 0;<br /> }<br /> <br /> [/code]]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/697/3798.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/697/3798.page</link>
				<pubDate><![CDATA[Mon, 25 Mar 2019 19:55:31]]> GMT</pubDate>
				<author><![CDATA[ BATIR]]></author>
			</item>
			<item>
				<title>Re:Handshakes</title>
				<description><![CDATA[ Па, веќе има дадено решение во другата тема (што ја спомнуваш):<br /> <a class="snap_shots" href="http://mendo.mk/jforum/posts/list/671.page" target="_blank" rel="nofollow">http://mendo.mk/jforum/posts/list/671.page</a><br /> <br /> Кликни само на линкот таму, па "sample solutions" кај првата задача. Има и решение и објаснување.]]></description>
				<guid isPermaLink="true">http://mendo.mk/jforum/posts/preList/697/3801.page</guid>
				<link>http://mendo.mk/jforum/posts/preList/697/3801.page</link>
				<pubDate><![CDATA[Tue, 26 Mar 2019 13:22:54]]> GMT</pubDate>
				<author><![CDATA[ petarsor]]></author>
			</item>
	</channel>
</rss>