1
#include<iostream>
2using namespace std ;
3int main()
4
{
5
long n, k, p ;
6 long color[200000], cost[200000] ;
7 //freopen( "2.in", "r", stdin ) ; freopen( "2.out", "w", stdout ) ;
8 cin >>n >>k >> p ;
9 for ( long i = 0; i < n; i++ ) cin >>color[i] >>cost[i] ;
10 long ans = 0 ;
11 for ( long i = 0; i < n-1; i++ )
12 for ( long j = i+1; j < n ; j++ )
13 if ( color[i]== color[j] )
14
{
15 long temp = 0 ;
16 for ( long cafe = i; cafe <= j && temp == 0 ; cafe++ )
17 if ( cost[cafe] <= p ) temp = 1 ;
18 ans += temp ;
19
}
20 cout << ans ;
21 return 0 ;
22
}
#include<iostream>2
using namespace std ;3
int main()4
{
5
long n, k, p ;6
long color[200000], cost[200000] ;7
//freopen( "2.in", "r", stdin ) ; freopen( "2.out", "w", stdout ) ;8
cin >>n >>k >> p ;9
for ( long i = 0; i < n; i++ ) cin >>color[i] >>cost[i] ;10
long ans = 0 ;11
for ( long i = 0; i < n-1; i++ )12
for ( long j = i+1; j < n ; j++ )13
if ( color[i]== color[j] ) 14
{
15
long temp = 0 ;16
for ( long cafe = i; cafe <= j && temp == 0 ; cafe++ )17
if ( cost[cafe] <= p ) temp = 1 ;18
ans += temp ;19
}20
cout << ans ;21
return 0 ;22
}
棰勬湡寰楀垎40~60
綆楁硶浜岋細
褰撶劧鏄疍P
鍔ㄦ佽鍒掞紝璁緁[i,j]涓哄墠i涓鏍堜腑鑹茶皟涓簀鐨勫彲琛屾柟妗堬紝s[i,j]涓哄墠i涓鏍堜腑鍙互涓庝箣鍚庤壊璋冧負j鐨勫鏍堟惌閰嶇殑瀹㈡爤鏁幫紝鍗蟲湁s[i,j]涓鏍堢殑鑹茶皟涓簀錛屼笖璇ュ鏍堜笌絎琲涓鏍堜箣闂存湁絎﹀悎鏉′歡鐨勫挅鍟″簵錛寁[i]涓虹i涓鏍堢殑鏈浣庢秷璐癸紝c[i]涓虹i涓鏍堢殑鑹茶皟a[i,j]涓哄墠i涓鏍堜腑鑹茶皟涓簀鐨勫鏍堢殑鏁扮洰錛屽垯鏈?br />s[i,j] = ( v[i] <= p ) ? a[i,j] : s[i-1,j]
f[j] = ( c != j ) ? f[j] : f[j]+s[j]
浠ｇ爜錛?/p>
1#include <cstdio>
2using namespace std ;
3int main()
4{
5 freopen( "2.in", "r", stdin ) ;
6 freopen( "2.out", "w", stdout ) ;
7 long n, m, p, i, j, ans, v = 0, c = 0 ;
8 long a[50] = {0}, s[50] = {0}, f[50] = {0} ;
9 scanf( "%ld%ld%ld", &n, &m, &p ) ;
10 for ( i = 1; i <=n; i++ )
11 {
12 scanf( "%ld%ld", &c, &v ) ;
13 if ( v <= p )
14 for ( j = 0; j < m; j++ ) s[j] = a[j] ;
15 for ( j = 0; j < m; j++ )
16 f[j] = ( c != j ) ? f[j] : f[j]+s[j] ;
17 a[c]++ ;
18 if ( v <= p ) s[c]++ ;
19 }
20 ans = 0 ;
21 for ( j = 0; j < m; j++ ) ans+= f[j] ;
22 printf( "%ld", ans ) ;
23 return 0 ;
24}
#include <cstdio>2
using namespace std ;3
int main()4
{5
freopen( "2.in", "r", stdin ) ;6
freopen( "2.out", "w", stdout ) ;7
long n, m, p, i, j, ans, v = 0, c = 0 ;8
long a[50] = {0}, s[50] = {0}, f[50] = {0} ;9
scanf( "%ld%ld%ld", &n, &m, &p ) ;10
for ( i = 1; i <=n; i++ )11
{12
scanf( "%ld%ld", &c, &v ) ;13
if ( v <= p ) 14
for ( j = 0; j < m; j++ ) s[j] = a[j] ;15
for ( j = 0; j < m; j++ )16
f[j] = ( c != j ) ? f[j] : f[j]+s[j] ;17
a[c]++ ;18
if ( v <= p ) s[c]++ ;19
}20
ans = 0 ;21
for ( j = 0; j < m; j++ ) ans+= f[j] ;22
printf( "%ld", ans ) ;23
return 0 ;24
}
Cool Wings 2012-11-03 20:45 鍙戣〃璇勮
]]>